String attractors of some simple-parry automatic sequences
From MaRDI portal
Cites work
- A combinatorial view on string attractors
- Abelian properties of Parry words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- At the roots of dictionary compression: string attractors
- Beta-integers as natural counting systems for quasicrystals
- Factorizing words over an ordered alphabet
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Free differential calculus. IV: The quotient groups of the lower central series
- Generalized Lyndon words
- How to write integers in a non-integral basis
- scientific article; zbMATH DE number 3693557 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- Inverse Lyndon words and inverse Lyndon factorizations of words
- New string attractor-based complexities for infinite words
- Numeration and enumeration
- Nyldon words
- On a class of infinite words with affine factor complexity
- On Repetitiveness Measures of Thue-Morse Words
- On the sequentiality of the successor function
- On theβ-expansions of real numbers
- Optimal-Time Dictionary-Compressed Indexes
- Palindromic complexity of infinite words associated with simple Parry numbers
- Sequences with minimal block growth
- String attractors and infinite words
- String Attractors for Factors of the Thue-Morse Word
- String attractors of episturmian sequences
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms
- Substitutions and \(\beta\) systems of numeration
- The Logical Approach to Automatic Sequences
- Toward a Definitive Compressibility Measure for Repetitive Sequences
- Unbordered factors and Lyndon words
- Universal compressed text indexing
This page was built for publication: String attractors of some simple-parry automatic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661762)
