Theoretical Computer Science
On the combinatorics of finite words
Theoretical Computer Science
Approximate string matching using factor automata
Theoretical Computer Science
Episturmian words and some constructions of de Luca and Rauzy
Theoretical Computer Science
Theoretical Computer Science
Fast and flexible string matching by combining bit-parallelism and suffix automata
Journal of Experimental Algorithmics (JEA)
A combinatorial problem on Trapezoidal words
Theoretical Computer Science
Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time
Proceedings of the 11th Colloquium on Automata, Languages and Programming
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Discovering characteristic expressions in literary works
Theoretical Computer Science
Word assembly through minimal forbidden words
Theoretical Computer Science
Algorithms on Strings
On different generalizations of episturmian words
Theoretical Computer Science
Note: Rich, Sturmian, and trapezoidal words
Theoretical Computer Science
European Journal of Combinatorics
A factor automaton approach for the forced alignment of long speech recordings
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Combinatorics of Finite Words and Suffix Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
From Nerode's congruence to suffix automata with mismatches
Theoretical Computer Science
Suffix automata and standard sturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Unsupervised spam detection based on string alienness measures
DS'07 Proceedings of the 10th international conference on Discovery science
A characterization of bispecial sturmian words
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
| Hi-index | 5.23 |
The suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages L"S"A and L"F"A of words having respectively suffix automaton and factor automaton with the minimal possible number of states.