Minimal automaton for multiplying and translating the Thue-Morse set

DOI10.37236/9068OpenAlexW3177671663MaRDI QIDQ2040011

Célia Cisternino, Adeline Massuir, Émilie Charlier

Publication date: 6 July 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Beyond odious and evil
• On additive properties of sets defined by the Thue-Morse word
• The growth function of \(S\)-recognizable sets
• Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
• The ring of \(k\)-regular sequences
• Logic and \(p\)-recognizable sets of integers
• Bertrand numeration systems and recognizability
• The definable criterion for definability in Presburger arithmetic and its applications.
• Minimal DFA for testing divisibility
• Periodicity, repetitions, and orbits of an automatic sequence
• An analogue of Cobham's theorem for graph directed iterated function systems
• Enumeration and Automatic Sequences
• A decision method for the recognizability of sets defined by number systems
• Representations of numbers and finite automata
• Automatic Sequences
• First-Order Logic and Numeration Systems
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• Decidability of the HD0L ultimate periodicity problem
• An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
• Questions Around the Thue-Morse Sequence
• Formal Languages, Automata and Numeration Systems 2
• Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure
• Number representation and finite automata
• On the base-dependence of sets of numbers recognizable by finite automata
• Uniform tag sequences
• Multiplicative properties of the Thue-Morse sequence

This page was built for publication: Minimal automaton for multiplying and translating the Thue-Morse set