Computability by finite automata and pisot bases

DOI10.1007/BF01578846zbMath0819.11005MaRDI QIDQ4298373

Daniel Berend, Christiane Frougny

Publication date: 31 August 1995

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

Pisot number

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic number theory computations (11Y40) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06) Other number representations (11A67)

Related Items

Numbers with fixed sum of digits in linear recurrent number systems, First-Order Logic and Numeration Systems, On beta expansions for Pisot numbers, Synchronized rational relations of finite and infinite words, Digit frequencies and Bernoulli convolutions, On an approximation property of Pisot numbers. II, Stabilizing stationary linear discrete systems: Minimal and balanced expansions in any real base, On a property of Pisot numbers and related questions, On-line digit set conversion in real base., An analogue of Cobham's theorem for graph directed iterated function systems, AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION, A property of Pisot numbers

Cites Work

• Unnamed Item
• Unnamed Item
• \(\beta\)-expansions and symbolic dynamics
• Finite beta-expansions
• Representations for real numbers and their ergodic properties
• On Periodic Expansions of Pisot Numbers and Salem Numbers
• Representations of numbers and finite automata