Theoretical Computer Science
Infinite words with linear subword complexity
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Some combinatorial properties of Sturmian words
Theoretical Computer Science
Automata for matching patterns
Handbook of formal languages, vol. 2
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Theoretical Computer Science
Constructing Suffix Trees On-Line in Linear Time
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Combinatories of Standard Sturmian Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Sturmian graphs and a conjecture of moser
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
The Number of Runs in Sturmian Words
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Compressed string-matching in standard Sturmian words
Theoretical Computer Science
Combinatorics of Finite Words and Suffix Automata
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Special factors and the combinatorics of suffix and factor automata
Theoretical Computer Science
A characterization of bispecial sturmian words
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
Theoretical Computer Science
Computing the number of cubic runs in standard Sturmian words
Discrete Applied Mathematics
On the structure of bispecial Sturmian words
Journal of Computer and System Sciences
Hi-index | 0.00 |
Blumer et al. showed (cf. [3,2]) that the suffix automaton of a word w must have at least |w|+1 states and at most 2|w|-1 states. In this paper we characterize the language L of all binary words w whose minimal suffix automaton S(w) has exactly |w| + 1 states; they are precisely all prefixes of standard Sturmian words. In particular, we give an explicit construction of suffix automaton of words that are palindromic prefixes of standard words. Moreover, we establish a necessary and sufficient condition on S(w) which ensures that if w ∈ L and a ∈ {0, 1} then wa ∈ L. By using such a condition, we show how to construct the automaton S(wa) from S(w). More generally, we provide a simple construction that by starting from an automaton recognizing all suffixes of a word w over a finite alphabet A, allows to obtain an automaton that recognizes the suffixes of wa, a ∈ A.