Primitive substitutive numbers are closed under rational multiplication

DOI10.5802/jtnb.231zbMath0930.11008OpenAlexW2069772107MaRDI QIDQ1292623

Luca Q. Zamboni, Pallavi Ketkar

Publication date: 23 June 1999

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_1998__10_2_315_0

zbMATH Keywords

automatic real numberssubstitutive real numbers

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Related Items

On the joint subword complexity of automatic sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Quasicrystal Ising chain and automata theory
• Substitution dynamical systems - spectral analysis
• Sums and rational multiples of \(q\)-automatic sequences are \(q\)-automatic
• Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms
• Iteration of maps by an automaton
• Transcendence of numbers with a low complexity expansion
• A characterization of substitutive sequences using return words
• A generalization of Sturmian sequences: Combinatorial structure and transcendence