and 4 others joined a min ago.
0
30kviews
Explain the closure properties of regular languages
1 Answer
2
463views
written 7.8 years ago by
teamques10
★ 65k
|
• modified 7.8 years ago |
1. Closure under Union
If L and M are regular languages, so is L UM.
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 U M
2. Closure under Concatenation and Kleene Closure …
ADD COMMENT
EDIT
Please log in to add an answer.