Revision as of 17:01, 2 April 2018 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,580 edits reword lead Tag: 2017 wikitext editor ← Previous edit		Revision as of 17:05, 2 April 2018 edit undo A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,580 edits m →Two-way nondeterministic finite automaton: consistency in style Tag: 2017 wikitext editor Next edit →
Line 49: == Two-way nondeterministic finite automaton == A '''two-way nondeterministic finite automaton''' (2NFA) may have multiple transitions defined in the same configuration. Its transition function is * <math>\delta: Q \times (\Sigma \cup \{L,R\}) \rightarrow 2^{Q \times \{left,right\}}</math>. Like a standard one-way [[Nondeterministic finite automaton\|NFA]], a 2NFA accepts a string if at least one of the possible computations is accepting. Like the 2DFAs, the 2NFAs also accept only regular languages.

Two-way finite automaton: Difference between revisions