I have this language {0+1+0+} and i need to prove it is regular,i had the idea to use the closure properties but i can find any regular languages to unify perhaps.Any ideas?
$\begingroup$
$\endgroup$
2
-
$\begingroup$ What about the concatenation of $0^+ = 00^*$ with $1^+ = 11^*$ with $0^+ = 00^*$? $\endgroup$ – Steven Nov 11 '20 at 11:38
-
$\begingroup$ Good one,i did not know that 0+ or 1+ was regular. $\endgroup$ – Jmk Nov 11 '20 at 11:57
Add a comment
|
$\begingroup$
$\endgroup$
Build a finite state machine. Or look up the definition, your definition will either say "there's a finite state machine", or "it's defined by a regular expression".
