On multiplicatively dependent linear numeration systems, and periodic points

DOI10.1051/ita:2002015zbMath1044.11004OpenAlexW2080859105MaRDI QIDQ4800260

Christiane Frougny

Publication date: 15 July 2003

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

finite automataParry numbersmultiplicatively dependent numeration basesPisot numerations

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Symbolic dynamics (37B10) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06) Other number representations (11A67)

Related Items (1)

SUR LE BÊTA-DÉVELOPPEMENT DE 1 DANS LE CORPS DES SÉRIES FORMELLES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to write integers in a non-integral basis
• Presburgerness of predicates regular in two number systems
• Independent numeration systems and syndeticity
• Numeration systems, linear recurrences, and regular sets
• Greedy numeration systems and regularity
• A generalization of Cobham's theorem
• Bertrand numeration systems and recognizability
• Representations for real numbers and their ergodic properties
• On theβ-expansions of real numbers
• Weak Second‐Order Arithmetic and Finite Automata
• Systems of Numeration
• Representations of numbers and finite automata
• Une généralisation du théorème de Cobham
• ON THE CONTEXT-FREENESS OF THE θ-EXPANSIONS OF THE INTEGERS
• AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
• An Introduction to Symbolic Dynamics and Coding
• An extension of the Cobham-Semënov Theorem
• On the base-dependence of sets of numbers recognizable by finite automata

This page was built for publication: On multiplicatively dependent linear numeration systems, and periodic points