String attractors of some simple-parry automatic sequences
From MaRDI portal
Publication:6661762
DOI10.1007/s00224-024-10195-7MaRDI QIDQ6661762
France Gheeraert, Giuseppe Romana, Manon Stipulanti
Publication date: 13 January 2025
Published in: Theory of Computing Systems (Search for Journal in Brave)
Theory of data (68Pxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Numeration and enumeration
- Abelian properties of Parry words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Substitutions and \(\beta\) systems of numeration
- How to write integers in a non-integral basis
- On the sequentiality of the successor function
- Universal compressed text indexing
- Inverse Lyndon words and inverse Lyndon factorizations of words
- A combinatorial view on string attractors
- Nyldon words
- Palindromic complexity of infinite words associated with simple Parry numbers
- On a class of infinite words with affine factor complexity
- Unbordered factors and Lyndon words
- Generalized Lyndon words
- The Critical Exponent is Computable for Automatic Sequences
- On theβ-expansions of real numbers
- Factorizing words over an ordered alphabet
- Beta-integers as natural counting systems for quasicrystals
- Optimal-Time Dictionary-Compressed Indexes
- The Logical Approach to Automatic Sequences
- At the roots of dictionary compression: string attractors
- Formal Languages, Automata and Numeration Systems 2
- Sequences with minimal block growth
- Free differential calculus. IV: The quotient groups of the lower central series
- String attractors and infinite words
- String Attractors for Factors of the Thue-Morse Word
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms
- String attractors of episturmian sequences
- Toward a Definitive Compressibility Measure for Repetitive Sequences
- On Repetitiveness Measures of Thue-Morse Words
- New string attractor-based complexities for infinite words
This page was built for publication: String attractors of some simple-parry automatic sequences
