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?
Asked
Active
Viewed 37 times
0
-
What about the concatenation of $0^+ = 00^$ with $1^+ = 11^$ with $0^+ = 00^*$? – Steven Nov 11 '20 at 11:38
-
Good one,i did not know that 0+ or 1+ was regular. – Jmk Nov 11 '20 at 11:57
1 Answers
0
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".
gnasher729
- 29,996
- 34
- 54