Automatic sequences: from rational bases to trees

DOI10.46298/dmtcs.8455arXiv2102.10828MaRDI QIDQ6045415

Michel Rigo, Manon Stipulanti

Publication date: 30 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.10828

zbMATH Keywords

automatic sequencesCobham's theoremabstract numeration systemsrational base numeration systemsPD0L systemsalternating morphisms

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Number theory (11-XX)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trees and languages with periodic signature
• Representing real numbers in a generalized numeration system
• The signature of rational languages
• Sturmian trees
• Powers of rationals modulo 1 and rational base number systems
• Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
• Bertrand numeration systems and recognizability
• Automatic sequences based on Parry or Bertrand numeration systems
• On Sets of Numbers Rationally Represented in a Rational Base Number System
• Breadth-First Serialisation of Trees and Rational Languages
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• A Second Course in Formal Languages and Automata Theory
• Systems of Numeration
• Automatic Sequences
• The on-line encyclopedia of integer sequences
• On the power of periodic iteration of morphisms
• On periodically iterated morphisms
• Formal Languages, Automata and Numeration Systems 2
• Abstract numeration systems
• Uniform tag sequences

This page was built for publication: Automatic sequences: from rational bases to trees