OurBigBook About$ Donate
 Sign in Sign up

Epsilon transition (qε​r)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Formal language theory Finite-state machine Nondeterministic finite automaton Epsilon-NFA
2026-10-31  0 By others on same topic  0 Discussions Create my own version
An automaton transition that consumes no input symbol. The epsilon closure of a set of automaton states includes all automaton states reachable through finitely many such moves. Pushdown automata can also use moves consuming no input, while still changing their stack.

 Ancestors (8)

  1. Epsilon-NFA
  2. Nondeterministic finite automaton
  3. Finite-state machine
  4. Formal language theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (5)

  • Conversion of a context-free grammar to a pushdown automaton
  • Finite automaton emptiness test
  • Past exam of the computer science course of the University of Oxford / 2015 / Models of computation / 1 / a / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Models of computation / 1 / b / i / Solution
  • Past exam of the computer science course of the University of Oxford / 2015 / Models of computation / 2 / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook