Theoretical Computer Science
Automata for matching patterns
Handbook of formal languages, vol. 2
On the combinatorics of finite words
Theoretical Computer Science
Asymptotic estimation of the average number of terminal states in DAWGs
Discrete Applied Mathematics
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Word assembly through minimal forbidden words
Theoretical Computer Science
On different generalizations of episturmian words
Theoretical Computer Science
Suffix automata and standard sturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
| Hi-index | 0.00 |
The suffix automaton of a finite word is the minimal deterministic automaton accepting the language of its suffixes. The states of the suffix automaton are the classes of an equivalence relation defined on the set of factors. We explore the relationship between the combinatorial properties of a finite word and the structural properties of its suffix automaton. We give formulas for expressing the total number of states and the total number of edges of the suffix automaton in terms of special factors of the word.