On the number of factors of Sturmian words
From MaRDI portal
Publication:805261
DOI10.1016/0304-3975(91)90172-XzbMATH Open0728.68093MaRDI QIDQ805261FDOQ805261
Authors: Filippo Mignosi 
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Uniform tag sequences
- Title not available (Why is that?)
- Infinite words with linear subword complexity
- Title not available (Why is that?)
- Sequences with minimal block growth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- Title not available (Why is that?)
Cited In (70)
- Counting minimal semi-Sturmian words
- The recurrence function of a random Sturmian word
- Squares and cubes in Sturmian sequences
- Optimal policies for observing time series and related restless bandit problems
- About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
- Ergodic infinite permutations of minimal complexity
- Some results on digital segments and balanced words
- Triangular partitions: enumeration, structure, and generation
- On the complexity functions of Sturmian words
- Lochs-type theorems beyond positive entropy
- Flexibility of the pressure function
- A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
- The complexity of functions on lattices
- The doubling map with asymmetrical holes
- A Note on a Conjecture of Duval and Sturmian Words
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Frequencies of factors of Sturmian sequences
- On covering a digital disc with concentric circles in \(\mathbb Z^2\)
- Weak repetitions in Sturmian strings.
- Digital straightness, circularity, and their applications to image analysis
- Generalized balances in Sturmian words
- Number-theoretic interpretation and construction of a digital circle
- Hierarchical structures in Sturmian dynamical systems
- A new geometric approach to Sturmian words
- Languages under substitutions and balanced words
- Crochemore Factorization of Sturmian and Other Infinite Words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian morphisms and Rauzy's rules
- Randomness and non-randomness properties of Piatetski-Shapiro sequences modulo \(m\)
- Powers in Sturmian sequences
- Digital straightness -- a review
- A connection between palindromic and factor complexity using return words
- Partitioned factors in Christoffel and Sturmian words
- Balancedness and coboundaries in symbolic systems
- Weak colored local rules for planar tilings
- Farey codes and languages
- Well-balanced sequences
- Enumeration formula for \((2,n)\)-cubes in discrete planes
- Balance properties of multi-dimensional words
- Double sequences of low complexity
- Random generation of finite Sturmian words
- The index of Sturmian sequences
- Factors of characteristic words of irrational numbers
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Special factors, periodicity, and an application to Sturmian words
- Some combinatorial properties of Sturmian words
- On the characterization of absentee-voxels in a spherical surface and volume of revolution in \({\mathbb Z}^3\)
- Some properties of the factors of Sturmian sequences.
- Abelian repetitions in Sturmian words
- On the conjugation of standard morphisms
- Digital straightness
- Lyndon words and singular factors of sturmian words
- A representation theorem of the suffixes of characteristic sequences
- On \(\theta\)-episturmian words
- Studies on finite Sturmian words
- Positions of the ranks of factors in certain finite long length words
- Fractional parts of powers of large rational numbers
- Sturmian morphisms and \(\alpha\)-words
- Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion
- On the structure of bispecial Sturmian words
- Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups
- Billiard complexity in the hypercube
- Sturmian numeration systems and decompositions to palindromes
- Combinatorial properties of sequences defined by the billiard in the tesselation triangles
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
- Sturmian and Episturmian Words
- On a combinatorial property of Sturmian words
- On low-complexity bi-infinite words and their factors
- On the fragmentary complexity of symbolic sequences
- Complexity and growth for polygonal billiards
This page was built for publication: On the number of factors of Sturmian words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805261)
