Results 91 to 100 of about 1,318,046 (112)
Studies on finite Sturmian words
Theoretical Computer Science, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christophe Reutenauer
exaly +3 more sources
Sturmian words and words with a critical exponent
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2005
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.
Aldo de Luca, Alessandro De Luca 0002
openaire +2 more sources
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.
Aldo de Luca, Alessandro De Luca 0002
openaire +2 more sources
On the Index of Sturmian Words
1999An infinite word x has finite index if the exponents of the powers of primitive words that are factors of x are bounded. F. Mignosi has proved that a Sturmian word has finite index if and only if the coefficients of the continued fraction development of its slope are bounded.
openaire +3 more sources
Language structure of pattern Sturmian words [PDF]
Discrete Mathematics, 2006 Pattern Sturmian words introduced by Kamae and Zamboni [Sequence entropy and the maximal pattern complexity of infinite words, Ergodic Theory Dynamical Systems 22 (2002) 1191–1199; Maximal pattern complexity for discrete systems, Ergodic Theory Dynamical
Bo Tan, Hui Rao, Yu-Mei Xue
exaly +2 more sources
Combinatorics of standard Sturmian words
1997We overview some recent developments of the theory of Sturmian words showing that the ’kernel’ of the theory is the combinatorics of the set PER of all finite words ω on the alphabet A={a,b} having two periods p and q which are coprimes and such that |w|=p+q-2. The elements of PER have many surprising structural properties.
openaire +3 more sources
Abstract A Sturmian word is a factor of a Christoffel word. A word is Sturmian if and only if it is balanced (Dulucq and Gouyou-Beauchamps) if and only if it has a factor which is a Christoffel word of length n and has n as period (de Luca and De Luca).
openaire +1 more source
openaire +1 more source
Burrows–Wheeler transform and Sturmian words
Information Processing Letters, 2003M Sciortino, A Restivo
exaly
Inequalities characterizing standard Sturmian and episturmian words
Theoretical Computer Science, 2005Giuseppe Pirillo
exaly