You are currently offline. Some features of the site may not work correctly.
Nondeterministic finite automaton
Known as: Nondeterministic Finite State Machine, Epsilon closure, Nondeterministic finite automata
In automata theory, a finite state machine is called a deterministic finite automaton (DFA), if * each of its transitions is uniquely determined by… Expand