Is it true that backtracking is allowed in deterministic finite automaton (as mentioned in many comparisons between DFA and NDFA)? If yes, how is it possible when transition in DFA is to a single state?


closed as unclear what you're asking by Evil, Discrete lizard Apr 23 at 20:00

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ Please cite at least one such comparison. $\endgroup$ – rici Apr 22 at 5:03
  • 1
    $\begingroup$ It looks like you've copy-pasted the question from quora.com/…, and then copy-pasted the answer below. We're not looking for you to repeat questions from other sites; we want to generate useful new questions and answers that don't already have answers; and it's not very useful to ask questions where the answer is already available elsewhere and findable on Google. $\endgroup$ – D.W. Apr 22 at 23:52

I'm not sure what your sources are here. DFAs read the characters of the input one after another, strictly in order and accept or reject according to the state they're in when they reach the end of the word. There is no backtracking.


Not the answer you're looking for? Browse other questions tagged or ask your own question.