Assertion: deterministic finite automaton | /r/HasProperty | special kind of nfa
Facets:
value: for each state
type: LOCATION
value: for alphabet
type: OTHER
Source sentences:
text: A Deterministic finite automaton (DFA) can be seen as a special kind of NFA, in which for each state and alphabet, the transition function has exactly one state.