I am trying find the regular expression that describes the finite automata in the image below.
Given the following finite automata
which of the following regular expressions describes the same language as the automaton.
- (ab)+c*d+
- a+b+c*d+
- a(ba)*bc*dd*
- [ab]+c*d+
- a(ba)*bc+d?d+
- (ab)+c+d*
I tried converting it to a regular expression and I got (ab)*ac*dd*, which is not among any of the options. Could someone help me select the correct answers?
I got (ab)*ac*dd*
how did you get the a between b and d? (dd*
is fine, depending on context/definition,d+
is a shorter version thereof.) $\endgroup$