On a class of infinite words with affine factor complexity
From MaRDI portal
Publication:2465623
Abstract: In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n)=an+b for any integer n.
Recommendations
- Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers
- Complexity of infinite words associated with beta-expansions
- Palindromic complexity of infinite words associated with non-simple Parry numbers
- Infinite special branches in words associated with beta-expansions
- scientific article; zbMATH DE number 2051159
Cites work
- scientific article; zbMATH DE number 3517961 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Complexity and special factors
- Complexity of infinite words associated with beta-expansions
- Complexity of sequences and dynamical systems
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- On theβ-expansions of real numbers
- Representations for real numbers and their ergodic properties
- Substitutions and \(\beta\) systems of numeration
Cited in
(11)- Sequences with constant number of return words
- Weighted prefix normal words: mind the gap
- Factorisation Forests for Infinite Words
- The cardinality of factors of infinite binary words for irrational circle rotations
- Complexity of infinite words associated with beta-expansions
- On complexity functions of infinite words associated with generalized Dyck languages
- Complexity for infinite words associated with quadratic non-simple Parry numbers
- Coloring factors of substitutive infinite words
- String attractors of some simple-parry automatic sequences
- On the structure of \((-\beta )\)-integers
- On low-complexity bi-infinite words and their factors
This page was built for publication: On a class of infinite words with affine factor complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465623)
