WIA
2007
Springer
13 years 10 months ago
2007
Springer
We study the pattern matching automaton introduced in [1] for the purpose of seed-based similarity search. We show that our definition provides a compact automaton, much smaller t...
TAMC
2007
Springer
13 years 10 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...