An automaton transition changes an automaton state on reading a symbol. A DFA specifies one destination; an NFA may specify several or none.

Ancestors (6)

  1. Finite-state machine
  2. Formal language theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (9)

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