Assertion: deterministic finite automaton | /r/CapableOf | define transition
Facets:
value: for each state
type: TRANSITIVE-OBJECT
value: for each input symbol
type: OTHER
Source sentences:
text: According to the above definition, deterministic finite automata are always complete: they define a transition for each state and each input symbol.