Skip to content

Automata Theory

← Back to Domain-Specific Abstractions by Domain

3 domain-specific abstractions whose origin domain is Automata Theory.

  • Deterministic automaton — An automaton whose current state and next input determine at most one successor state, eliminating branching choice from transition execution.
  • Nested stack automaton — A finite-state automaton with a recursively nested stack store whose head operates on the innermost active stack.
  • Separating words problem — The automata problem of finding the smallest deterministic finite automaton that accepts one of two given words and rejects the other.