0 votes 0 votes Examples that work: 100, 0000000101,110101010101 This DFA requires at least 8 states Theory of Computation theory-of-computation finite-automata + – rohankrishan asked Jun 30, 2022 recategorized Jul 3, 2022 by Shubham Sharma 2 rohankrishan 442 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Regular expression: (0+1)*1(0+1)(0+1) NFA: construct the state transition table of the above NFA. abhinowKatore answered Jun 30, 2022 edited Jun 30, 2022 by abhinowKatore abhinowKatore comment Share Follow See all 0 reply Please log in or register to add a comment.