Codex Wiki OurBigBook logoOurBigBook.comSite Source code
A deterministic finite automaton has finitely many states and one transition for each state-symbol pair.

Ancestors (5)

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