Prove if two language are regular then ther union is also regular
Answers
Answered by
0
: The set of regular languages over an alphabet is closed under operations union, concatenation and Kleene star. Proof: Let Lr and Ls be regular languages over an alphabet . ... Note 1: Later we shall see that the complement of a regular language and the intersection of regular laguages are also regular
Similar questions