New string attractor-based complexities for infinite words
From MaRDI portal
Publication:6612124
DOI10.1016/j.jcta.2024.105936MaRDI QIDQ6612124
France Gheeraert, Manon Stipulanti, Julien Cassaigne, Marinella Sciortino, Antonio Restivo, Giuseppe Romana
Publication date: 30 September 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Sturmian wordfactor complexityrecurrence functionstring attractorrepetitiveness measure\(k\)-Bonacci word
Theory of data (68Pxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Languages under substitutions and balanced words
- Circular Sturmian words and Hopcroft's algorithm
- Burrows-Wheeler transform and Sturmian words
- Complexity and special factors
- Some combinatorial properties of Sturmian words
- Comparison of LZ77-type parsings
- On extending de Bruijn sequences
- Prefix palindromic length of the Sierpinski word
- Logarithmic equal-letter runs for BWT of purely morphic words
- A combinatorial view on string attractors
- Palindromic complexity of infinite words associated with simple Parry numbers
- Symbolic dynamics.
- Words with unbounded periodicity complexity
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- The Lempel–Ziv Complexity of Fixed Points of Morphisms
- Hopcroft’s Algorithm and Cyclic Automata
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- On the Complexity of Finite Sequences
- Fast Pattern Matching in Strings
- Automatic Sequences
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Decidability of periodicity for infinite words
- Dimension Groups and Dynamical Systems
- At the roots of dictionary compression: string attractors
- Factor complexity
- Suffix Automata and Standard Sturmian Words
- Episturmian words and some constructions of de Luca and Rauzy
- String attractors and infinite words
- Decidable problems in substitution shifts
- 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
Related Items (1)
This page was built for publication: New string attractor-based complexities for infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612124)
