0 votes 0 votes Design NDFA over {0,1} in which two 0s are separated by a string of length 2i, for i>0 and convert it into equivalent dfa? Theory of Computation theory-of-computation + – gabbar asked Feb 19, 2017 gabbar 458 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes https://gateoverflow.in/?qa=blob&qa_blobid=5926935156079965163 arch answered Feb 19, 2017 arch comment Share Follow See all 2 Comments See all 2 2 Comments reply Lakshay Kakkar commented Feb 21, 2017 reply Follow Share @arch Please also explain how to draw the NDFA for the same. Thanks 0 votes 0 votes arch commented Feb 21, 2017 reply Follow Share https://gateoverflow.in/?qa=blob&qa_blobid=15572486550868837800 a finite state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source state and input symbol, and reading an input symbol is required for each state transition. A nondeterministic finite automaton (NFA), or nondeterministic finite state machine, does not need to obey these restrictions. 0 votes 0 votes Please log in or register to add a comment.