Self-generating sets, integers with missing blocks, and substitutions

DOI10.1016/j.disc.2004.12.004zbMath1117.11020OpenAlexW2036328331MaRDI QIDQ1773352

Jean-Paul Allouche, Gencho Skordev, Jeffrey O. Shallit

Publication date: 28 April 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.12.004

zbMATH Keywords

Fibonacci sequenceThue-Morse sequenceAutomatic sequencesIntegers with missing blocksKimberling sequenceLazy Fibonacci expansionMorphic sequencesSelf-generating sets

Mathematics Subject Classification ID

Combinatorics on words (68R15) Radix representation; digital problems (11A63) Automata sequences (11B85)

Related Items (5)

How to prove that a sequence is not automatic ⋮ On the Recognizability of Self-generating Sets ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ Unnamed Item ⋮ A central limit theorem for integer partitions

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of automatic sequences
• The ring of \(k\)-regular sequences
• Iteration of maps by an automaton
• Numeration systems, linear recurrences, and regular sets
• Greedy numeration systems and regularity
• Affinely recursive sets and orderings of languages.
• Generalization of automatic sequences for numeration systems on a regular language
• Enumeration of factors in the Thue-Morse word
• A relative of the Thue-Morse sequence
• \(\beta\)-shift, numeration systems, and automata
• Automatic Sequences
• Characterization of the unique expansions $1=\sum^{\infty}_{i=1}q^{-n_ i}$ and related problems
• Numeration systems on a regular language

This page was built for publication: Self-generating sets, integers with missing blocks, and substitutions