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
Suffix automaton
Minimal DFA accepting set of all suffixes of particular string
tag system
deterministic computational model
deterministic acyclic finite state automaton
computer data structure that represents a finite set of strings