deterministic finite automata
Web definitions
In automata theory, a branch of theoretical computer science, a deterministic finite automaton —also known as deterministic finite state machine—is a finite state machine that accepts/rejects finite strings of symbols and only produces a unique computation of the automaton for each input string. ...
No comments:
Post a Comment