Closure Properties of Regular Languages.ppt

Closure Properties of Regular Languages Union, Intersection, Difference, Concatenation, Kleene Closure, Reversal, Homomorphism, Inverse Homomorphism Closure Under Union If L and M are regular languages, so is L ? M. Proof: Let L and M be the languages of regular expressions R and S, respectively. Then R+S is a regular expression whose language is L ? M. Closure Under Concatenation and Kleene Closure Same idea: RS is a regular expression whose language is LM. R* is a regular expression whose language is L*. Closure Under Intersection If L and M are regular languages, then so is L ? M. Proof: Let A and B be DFA’s whose languages are L and M, respectively. Construct C, the product automaton of A and B. Make the final states of C be the pairs consisting of final states of both A and B. Example: Product DFA for Intersection Example: Use of Closure Property We proved L1 = {0n1n | n 0} is not a regular language. L2 = the set of strings with an equal number of 0’s and 1’s isn’t either, but that fact is trickier to prove. Regular languages are closed under ?. If L2 were regular, then L2 ?L(0*1*) = L1 would be, but it isn’t. Closure Under Difference If L and M are regular languages, then so is L – M = strings in L but not M. Proof: Let A and B be DFA’s whose languages are L and M, respectively. Construct C, the product automaton of A and B. Final states of C are the pairs whose A-state is final but whose B-state is not. Example: Product DFA for Difference Closure Under Complementation The complement of a language L (with respect to an alphabet Σ such that Σ* contains L) is Σ* – L. Since Σ* is surely regular, the complement of a regular language is always regular. Closure Under Reversal Recall example of a DFA that accepted the binary strings that, as integers were divisible by 23. We said that the language of binary strings whose reversal was divisible by 23 was also regular, but the DFA construction was tricky. Here’s the “tricky” construction. Closure Under Reversal – (2