1 votes 1 votes What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon? Theory of Computation theory-of-computation minimal-state-automata regular-expression finite-automata + – sripo asked Nov 6, 2018 sripo 3.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes language accpted will be {£,11,111,1111,11111,......................} dfa will have 4 states For nfa remove the dead stage and correspondong edges adarsh_1997 answered Nov 6, 2018 • selected Nov 10, 2018 by sripo adarsh_1997 comment Share Follow See all 0 reply Please log in or register to add a comment.