Back
Add Comment
Topics
Vote
Results
deterministic finite automata
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
--Agreed Upon Solutions

The discussion does not exist would you like to add the first comment?

anonymous