How do i prove this language is regular? 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?
Build a finite state machine. Or look up the definition, your definition will either say &quot;there's a finite state machine&quot;, or &quot;it's defined by a regular expression&quot;.