deterministic finite automaton (Q837528)

From Wikidata
Jump to: navigation, search
finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string
  • DFA
  • deterministic finite acceptor
  • deterministic finite state machine
  • DFSM
edit
Language Label Description Also known as
English
deterministic finite automaton
finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string
  • DFA
  • deterministic finite acceptor
  • deterministic finite state machine
  • DFSM

Statements

Identifiers