edited by
4,177 views

1 Answer

Best answer
37 votes
37 votes

NFA for regular expression $(a+b)^*abb$ and its equivalent $\textsf{DFA}$ will be as follows:

edited by

Related questions

26 votes
26 votes
3 answers
1
Kathleen asked Sep 15, 2014
7,847 views
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has$2$ states$3$ states$4$ states$5$ states