scientific article; zbMATH DE number 3871492
From MaRDI portal
Publication:3338346
Recommendations
Cited in
(52)- Infinite-vertex free profinite semigroupoids and symbolic dynamics.
- de Bruijn sequences and de Bruijn graphs for a general language
- Minimum Eulerian circuits and minimum de Bruijn sequences
- The ring of k-regular sequences
- Limit values of the recurrence quotient of Sturmian sequences
- Automaticity. II: Descriptional complexity in the unary case
- Conjugacy and episturmian morphisms.
- Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
- Episturmian words and episturmian morphisms
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Morphismes unispectraux. (Unispectral morphisms)
- Special factors of automatic sequences
- Random generation of finite Sturmian words
- On finite presentations of inverse semigroups with zero having polynomial growth
- 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
- Classification of rotations on the torus \(\mathbb T^2\)
- Recurrence in infinite partial words
- Spectral continuity for aperiodic quantum systems: applications of a folklore theorem
- Combinatoire de mots récurrents de complexitén+2
- On extremal properties of the Fibonacci word
- Représentation géométrique de suites de complexité 2n+1
- Complexity of sequences defined by billiard in the cube
- Some algorithms to compute the conjugates of Episturmian morphisms
- Growth properties of power-free languages
- Minimum complexity of automatic non sturmian sequences
- An estimation of phase transition *
- Quasi-Sturmian colorings on regular trees
- Continued fraction algorithm for Sturmian colorings of trees
- Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
- Episturmian words: a survey
- Balancing and clustering of words in the Burrows-Wheeler transform
- The complexity of Fibonacci-like kneading sequences
- Episturmian words and some constructions of de Luca and Rauzy
- Covering numbers: Arithmetics and dynamics for rotations and interval exchanges
- On factor graphs of DOL words
- Abelian combinatorics on words: a survey
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces
- Minimal Complexities for Infinite Words Written with d Letters
- Regularity of k-Abelian Equivalence Classes of Fixed Cardinality
- An upper bound of the number of distinct powers in binary words
- On the complexity functions of Sturmian words
- Frequencies of factors of Sturmian sequences
- New orientable sequences
- The reflection complexity of sequences over finite alphabets
- On the number of squares in a finite word
- Translation algorithms for graph covers
- On cardinalities of \(k\)-abelian equivalence classes
- On the number of factors of Sturmian words
- Palindromic prefixes and episturmian words
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3338346)
