in Theory of Computation recategorized by
125 views
0 votes
0 votes
Examples that work: 100, 0000000101,110101010101

 

This DFA requires at least 8 states
in Theory of Computation recategorized by
125 views

1 Answer

0 votes
0 votes

Regular expression: (0+1)*1(0+1)(0+1)

NFA:

construct the state transition table of the above NFA.

 

 

edited by