I can't think of an example of a non-regular language $L$ such that $L^*$ is regular. . Any help ?
Asked By : Altaïr
Answered By : R B
Define $L=\{a^nb^n|n\in \mathbb N\}\cup \{a,b\}$
It's not hard to see that while $L$ is not regular, $L^*=\Sigma^*$.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/35350
0 comments:
Post a Comment
Let us know your responses and feedback