in Theory of Computation
410 views
0 votes
0 votes

Examples of accepted words: 1011, 101101, 1111

Example of non-accepted words: 101, 1001, 010

The solution says the min-DFA contains 5 states but I could only do it in 4. Am I correct or where am I going wrong?
My solution:

in Theory of Computation
410 views

3 Comments

“111” is accepted by the dfa but it should not as  it has odd length.
2
2

@Kabir5454 Can the transition on ‘1’ at q3 go to q2?

0
0

Maybe I see now where I was going wrong. Is this one correct?
 

1
1

Please log in or register to answer this question.

Related questions