1,067 views
1 votes
1 votes
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).

1 Answer

3 votes
3 votes

see this dfa. let me know if i'm wrong

Related questions

3 votes
3 votes
1 answer
1
2 votes
2 votes
1 answer
4
rahul sharma 5 asked Nov 9, 2017
938 views
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}