This question already has an answer here:
- Convert regular expression to DFA 2 answers
I'm trying to construct a finite-state automaton from the following regular expression:
$$ (a|ba)(a|ba)^*(b|ab)^* $$
I know that from $$ (a|ba) $$
the automaton should look something like this:
from $$ (a|ba)^* $$
it should look like this I guess:
and from $$ (b|ab)^* $$
is pretty much the same as the last one, the thing is I don't know how to unite them in one automaton.
I would appreciate any help in this matter
PS: I'm sorry for the images I'm still learning how to work with the automata editor jflap...