Regular Expression in Finite Automata -
i need explanation of regular expression of :
all strings of {a,b} not contain 2 or more consecutive a's.
the regex described should not generate string has "aa" substring.
- if have finite automata can convert regex using algorithm state elimination: (here youtube link)
- if want direct regex following work: left part covers ends b along empty string. right 1 covers ends a.
( (ab + b)* + ((ab + b)* a) )
Comments
Post a Comment