and 5 others joined a min ago.
0
5.3kviews
State and explain closure properties of regular languages
1 Answer
0
51views
written 7.9 years ago by
teamques10
★ 70k
|
• modified 7.9 years ago |
Closure under Union
If L and M are regular languages, so is L U 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 U M
Closure under Concatenation and Kleene Closure
The …
and 3 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.