scientific article
From MaRDI portal
Publication:3338346
zbMath0547.10048MaRDI QIDQ3338346
Publication date: 1983
Full work available at URL: https://eudml.org/doc/182163
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
growthSturm sequencesnumber of words of length nsequence over a finite alphabetsolved and unsolved problems
Related Items
Reversals and palindromes in continued fractions, A geometrical characterization of factors of multidimensional billiard words and some applications, A connection between palindromic and factor complexity using return words, Recurrence in infinite partial words, Palindromic prefixes and episturmian words, Complexity of sequences defined by billiard in the cube, Episturmian words: a survey, Représentation géométrique de suites de complexité $2n+1$, Special factors of automatic sequences, Random generation of finite Sturmian words, Automaticity. II: Descriptional complexity in the unary case, Abelian combinatorics on words: a survey, Mortality and Edge-to-Edge Reachability are Decidable on Surfaces, Conjugacy and episturmian morphisms., Minimum complexity of automatic non sturmian sequences, Minimal Complexities for Infinite Words Written with d Letters, Regularity of k-Abelian Equivalence Classes of Fixed Cardinality, Combinatoire de mots récurrents de complexitén+2, An upper bound of the number of distinct powers in binary words, Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.), Quasi-Sturmian colorings on regular trees, Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\)., On extremal properties of the Fibonacci word, Growth properties of power-free languages, Classification of rotations on the torus \(\mathbb T^2\), Frequencies of factors of Sturmian sequences, The ring of \(k\)-regular sequences, Balancing and clustering of words in the Burrows-Wheeler transform, Episturmian words and some constructions of de Luca and Rauzy, The complexity of Fibonacci-like kneading sequences, Covering numbers: Arithmetics and dynamics for rotations and interval exchanges, On factor graphs of DOL words, On cardinalities of \(k\)-abelian equivalence classes, Infinite-vertex free profinite semigroupoids and symbolic dynamics., Spectral continuity for aperiodic quantum systems: Applications of a folklore theorem, Continued fraction algorithm for Sturmian colorings of trees, Some algorithms to compute the conjugates of Episturmian morphisms, Morphismes unispectraux. (Unispectral morphisms), Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders, Limit values of the recurrence quotient of Sturmian sequences, de Bruijn sequences and de Bruijn graphs for a general language, Minimum Eulerian circuits and minimum de Bruijn sequences, On finite presentations of inverse semigroups with zero having polynomial growth, On the number of factors of Sturmian words, Episturmian words and episturmian morphisms, Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution, An estimation of phase transition *
