Confluent linear numeration systems

DOI10.1016/0304-3975(92)90249-FzbMath0787.68057MaRDI QIDQ1202923

Christiane Frougny

Publication date: 22 April 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

numeration systemslinear recurrencefinite automatonrewriting systemtransducer

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

On-line finite automata for addition in some numeration systems ⋮ Palindromic complexity of infinite words associated with simple Parry numbers ⋮ On alpha-adic expansions in Pisot bases ⋮ On \(\alpha \)-greedy expansions of numbers ⋮ Continued fractions and numeration in the Fibonacci base ⋮ Finite beta-expansions with negative bases ⋮ Linear numeration systems, θ-developments and finite automata ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Rewriting rules for arithmetics in alternate base systems ⋮ Calculating the numbers of representations and the Garsia entropy in linear numeration systems ⋮ Numeration and enumeration ⋮ Study of irreducible balanced pairs for substitutive languages ⋮ Optimal number representations in negative base ⋮ Computing the prefix of an automaton ⋮ Alphabets, rewriting trails and periodic representations in algebraic bases ⋮ Unnamed Item ⋮ Symmetrized \(\beta \)-integers ⋮ Description of spectra of quadratic Pisot units ⋮ Confluent Parry numbers, their spectra, and integers in positive- and negative-base number systems ⋮ Lattice bounded distance equivalence for 1D Delone sets with finite local complexity ⋮ On the dichotomy of Perron numbers and beta-conjugates ⋮ On numbers having finite beta-expansions ⋮ Generalization of automatic sequences for numeration systems on a regular language ⋮ Beta expansion of Salem numbers approaching Pisot numbers with the finiteness property ⋮ On-line digit set conversion in real base. ⋮ On synchronized sequences and their separators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relations rationnelles infinitaires
• How to write integers in a non-integral basis
• Codeterministic automata on infinite words
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• \(\beta\)-expansions and symbolic dynamics
• Fibonacci representations and finite automata
• Representations for real numbers and their ergodic properties
• On theβ-expansions of real numbers
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• On Relations Defined by Generalized Finite Automata