Palindromic complexity of infinite words associated with simple Parry numbers
From MaRDI portal
Publication:2372771
DOI10.5802/aif.2236zbMath1121.68089arXivmath/0603608OpenAlexW2949773583MaRDI QIDQ2372771
Christiane Frougny, Petr Ambrož, Zuzana Masáková, Edita Pelantová
Publication date: 1 August 2007
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0603608
Related Items (21)
Reciprocal Sum of Palindromes ⋮ Factor versus palindromic complexity of uniformly recurrent infinite words ⋮ A connection between palindromic and factor complexity using return words ⋮ Episturmian words: a survey ⋮ On the least number of palindromes contained in an infinite word ⋮ Extensions of rich words ⋮ On theta-palindromic richness ⋮ Some properties of the \(k\)-bonacci words on infinite alphabet ⋮ Study of irreducible balanced pairs for substitutive languages ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ Rich, Sturmian, and trapezoidal words ⋮ Symmetrized \(\beta \)-integers ⋮ On \(k\)-abelian palindromes ⋮ Longest arithmetic progressions of palindromes ⋮ Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers ⋮ A new characteristic property of rich words ⋮ Pattern avoidance by palindromes ⋮ Palindromic richness ⋮ Rich and Periodic-Like Words ⋮ Codings of rotations on two intervals are full ⋮ Rich square-free words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Substitutions and \(\beta\) systems of numeration
- Substitutions in dynamics, arithmetics and combinatorics
- How to write integers in a non-integral basis
- Substitution dynamical systems - spectral analysis
- Confluent linear numeration systems
- Complexity and special factors
- A simple characterization of Sturm numbers
- Episturmian words and episturmian morphisms
- Substitution invariant Sturmian bisequences
- Palindrome complexity.
- Singular continuous spectrum for palindromic Schrödinger operators
- Palindromes and Sturmian words
- Factor versus palindromic complexity of uniformly recurrent infinite words
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Échanges d'intervalles et transformations induites
- Representations for real numbers and their ergodic properties
- On theβ-expansions of real numbers
- Représentation géométrique de suites de complexité $2n+1$
- Beta-integers as natural counting systems for quasicrystals
- Conjugates of Beta-Numbers and the Zero-Free Domain for a Class of Analytic Functions
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- Complexity of infinite words associated with beta-expansions
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
- On substitution invariant Sturmian words: an application of Rauzy fractals
- Interval exchange transformations
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Palindromic complexity of infinite words associated with simple Parry numbers
