Epsilon transition
An epsilon transition[1] (also epsilon move[1] or lambda transition) allows an automaton to change its state spontaneously, i.e. without consuming an input symbol. It may appear in almost all kinds of nondeterministic automaton in formal language theory, in particular:
- Nondeterministic Turing machine
- Nondeterministic pushdown automaton
- Nondeterministic finite automaton
References
- ^ a b John E. Hopcroft and Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Reading/MA: Addison-Wesley. ISBN 0-201-02988-X. Here: p.24,27
This disambiguation page lists articles associated with the title Epsilon transition.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.