![]() ![]() Two-way deterministic finite automaton Ī two-way deterministic finite automaton ( 2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. 3 Two-way nondeterministic finite automaton.1 Two-way deterministic finite automaton.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |