Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Extended transition of a nondeterministic finite automaton

Without epsilon transitions, define
(35)
A word is accepted when the set reached from the initial state meets the final set.

Ancestors (6)

  1. Nondeterministic finite automaton
  2. Formal language theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home