When the Kleene Star (*) is applied to bracketed expression, it is not necessary for each of the zero
or more matches of the expression to be identical, so long as they each match the expression.
For example (ab|c)* matches "cab", with the bracketed expression first accepting "c" and then "ab".
Construct a finite state machine that accepts the language defined by the regular expression (ab|c)*
or more matches of the expression to be identical, so long as they each match the expression.
For example (ab|c)* matches "cab", with the bracketed expression first accepting "c" and then "ab".
Construct a finite state machine that accepts the language defined by the regular expression (ab|c)*