Assertion: deterministic finite automaton | /r/Synonym | semiautomaton
Facets:
Source sentences:
text: A deterministic finite automaton without accept states and without a starting state is known as a transition system or semiautomaton.