deterministic finite automata
Sign in to saveAlso known as DFA, deterministic finite acceptor, deterministic finite state machine, DFSM
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
Wikidata facts
Show 2 more facts
- short name
- ДКА
- opposite of
- nondeterministic finite automaton
Sources (2)
via Wikidata · CC0