Abstract
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. © 2009 Springer.
Cite
CITATION STYLE
Fici, G. (2009). Combinatorics of finite words and suffix automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5725 LNCS, pp. 250–259). https://doi.org/10.1007/978-3-642-03564-7_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
