Home »
MCQs »
Theory of Computation MCQs
If L is a regular language, then its Kleen closure L1* will ____
32. If L is a regular language, then its Kleen closure L1* will ____.
- will not be a regular language
- will also be a regular language
Answer: B) will also be a regular language.
Explanation:
If L is a regular language, then its Kleen closure L1* will also be a regular language.