1 votes 1 votes Examples of what works: 01101101101101 1011101010 1010 0101 Theory of Computation finite-automata theory-of-computation + – rohankrishan asked Jun 30, 2022 • recategorized Jul 3, 2022 by Shubham Sharma 2 rohankrishan 654 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Check if this is working.. ssadu answered Jul 3, 2022 ssadu comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments ankitgupta.1729 commented Jul 8, 2022 i edited by ankitgupta.1729 Jul 8, 2022 reply Follow Share @Shubham Sharma 2Below 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 votes 2 votes Shubham Sharma 2 commented Jul 8, 2022 reply Follow Share thanks, @ankitgupta.1729The 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 votes 0 votes ankitgupta.1729 commented Jul 8, 2022 reply Follow Share Mistakes are part of life :P Like me and you, everyone do mistakes. No one is perfect. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes I think is the answer ritik456 answered Jul 11, 2022 ritik456 comment Share Follow See all 0 reply Please log in or register to add a comment.
