Regular Expression and its Closure Properties
Regular Expression and its Closure Properties Closure properties on regular languages are defined as follows: The closure is nothing more than an operation done on a language, the outcome of which is a new language of the same "type" as the original. Thus, When closure procedures are applied to some regular languages, the outcome is likewise a regular language. If the resultant language is still a regular language after the closure procedure, it retains the closure property. As an example, Assume N is a collection of natural numbers, i.e. N=1,2,3,...infinity. If we add two or more numbers together, the result will be inset N. As a result, the addition operation is referred to as the closure attribute of set N. Assume that any two numbers are subtracted, e.g. 5-12 =-7. The result -7 is not a set N value. As a result, subtraction does not preserve the closure condition of set N in this case. R...