THE FINITE AUTOMATA APPROACHES IN STRINGOLOGY
We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).
finite automata degenerate symbol exact pattern matching approximate pattern matching dynamic programming bitwise parallelism suffix automaton border array