String Attractors of Some Simple-Parry Automatic Sequences
- 10 September 2024
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (6) , 1601-1621
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ministero dell’Università e della Ricerca (2022YRB97K)
- Fonds De La Recherche Scientifique - FNRS (1.C.104.24F)
This publication has 31 references indexed in Scilit:
- String Attractors and Infinite Words2022
- On Repetitiveness Measures of Thue-Morse Words2020
- Inverse Lyndon words and inverse Lyndon factorizations of wordsAdvances in Applied Mathematics, 2018
- Formal Languages, Automata and Numeration Systems 22014
- On the Sequentiality of the Successor FunctionInformation and Computation, 1997
- Substitutions et β-systèmes de numérationTheoretical Computer Science, 1995
- Comment ecrire les nombres entiers dans une base qui n'est pas entiereActa Mathematica Hungarica, 1989
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- Sequences with minimal block growthTheory of Computing Systems, 1973
- On theβ-expansions of real numbersActa Mathematica Hungarica, 1960