Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Nondeterministic finite automaton

A nondeterministic finite automaton assigns a set of possible successor states to each state-symbol pair and accepts when at least one run ends in a final state.

Ancestors (5)

  1. Formal language theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5. Home

Incoming links (1)