I have a problem and I don't understand it. I need to find a language $L$ (using the alphabet $\Sigma = \{a,b\}$) The problem is that $L$ can't be $\{a,b\}^*$ or $\{\epsilon\}$ and it must be equal to $L^*$. Any ideas? Sorry if my english is not good.
How to find a language L that is equal to L*??
0
$\begingroup$
automata
formal-languages
regular-language
finite-automata
-
0Hint: what set is represented by $X^{**}$, for any set $X$? – 2017-02-12
-
0I don't know, is it about Kleene Star? – 2017-02-12