How many states are there in a minimum state automata equivalent to regular expression given below?
Regular expression is $a^*b(a+b)$
The minimal automata for the regular expression : $a^*b(a+b)$ is as shown below
$\therefore$ Option $C.$ $3$ is the correct answer.
@Arjun
Please verify this answer once.
I think answer is four. Because it also has to reject the strings like bab,abba,etc.
64.3k questions
77.9k answers
244k comments
80.0k users
