1,069 views

2 Answers

Best answer
5 votes
5 votes

First state and last state in your DFA are equivalents. 

it will be look like :

DFA over {a,b} that accepts all strings that doesn't contain "aa" as substring. 

selected by
0 votes
0 votes

Apply state elimination methods:

Regular expression will be like below

b*a(bb*a)*

Related questions

2 votes
2 votes
2 answers
2
Tuhin Dutta asked Dec 4, 2017
782 views
Give the language and Regular Expression for this finite automaton.Is it a DFA or NFA? Can we draw a DFA without a single final state?
1 votes
1 votes
6 answers
3
1 votes
1 votes
1 answer
4
sripo asked Nov 6, 2018
2,973 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?