String Attractors of Fixed Points of k-Bonacci-Like Morphisms
From MaRDI portal
Publication:6134874
DOI10.1007/978-3-031-33180-0_15arXiv2302.13647OpenAlexW4381304385MaRDI QIDQ6134874FDOQ6134874
Giuseppe Romana, France Gheeraert, Manon Stipulanti
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Abstract: Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words. In this context, they have been studied for several families of finite and infinite words. In this paper, we obtain string attractors of prefixes of particular infinite words generalizing k-bonacci words (including the famous Fibonacci word) and obtained as fixed points of k-bonacci-like morphisms. In fact, our description involves the numeration systems classically derived from the considered morphisms
Full work available at URL: https://arxiv.org/abs/2302.13647
Fibonacci wordnumeration systemsmorphic sequencesstring attractorsparry numbersstring attractor profile function
Cites Work
- On theβ-expansions of real numbers
- Title not available (Why is that?)
- Automatic Sequences
- Title not available (Why is that?)
- Generalized Lyndon words
- Free differential calculus. IV: The quotient groups of the lower central series
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- On the sequentiality of the successor function
- Numeration and enumeration
- Optimal-Time Dictionary-Compressed Indexes
- Substitutions and \(\beta\) systems of numeration
- Numeration systems on a regular language
- Formal Languages, Automata and Numeration Systems 2
- How to write integers in a non-integral basis
- Greedy numeration systems and regularity
- At the roots of dictionary compression: string attractors
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Nyldon words
- String attractors and infinite words
- Title not available (Why is that?)
- A combinatorial view on string attractors
- A full characterization of Bertrand numeration systems
- The Logical Approach to Automatic Sequences
- String Attractors of Fixed Points of k-Bonacci-Like Morphisms
Cited In (4)
This page was built for publication: String Attractors of Fixed Points of k-Bonacci-Like Morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134874)
