in Theory of Computation recategorized by
580 views
1 vote
1 vote
Examples of what works:

01101101101101

1011101010

1010

0101
in Theory of Computation recategorized by
580 views

2 Answers

2 votes
2 votes

Check if this is working..

by

4 Comments

edited by

@Shubham Sharma 2

Below half part of the above figure can be obtained by changing 1 to 0 and 0 to 1. It is like horizontal symmetry present in the states.

2
2

thanks, @ankitgupta.1729

The whole DFA is based on this input set {000,111,0101,1010,11011,00100,...}, I was trying to build using minimum number(less than the required number actually) of states which lead to few mistakes. 

0
0
Mistakes are part of life :P

Like me and you, everyone do mistakes. No one is perfect.
1
1
0 votes
0 votes

I think is the answer 

Related questions