Number representation and finite automata
From MaRDI portal
Publication:5393496
DOI10.1017/CBO9780511777653.003zbMath1216.68142MaRDI QIDQ5393496
Jacques Sakarovitch, Christiane Frougny
Publication date: 18 April 2011
Published in: Combinatorics, Automata and Number Theory (Search for Journal in Brave)
wordssymbolic dynamicsfinite automatarepresentation of integerstransducersPisot numberfinite state machines\(U\)-systemsbase changingrepresentation of realszero (Büchi) automaton
Formal languages and automata (68Q45) Dynamical aspects of cellular automata (37B15) Radix representation; digital problems (11A63) Automata sequences (11B85)
Related Items (23)
Surminimisation of Automata ⋮ Multi-dimensional sets recognizable in all abstract numeration systems ⋮ Unnamed Item ⋮ Numeration and discrete dynamical systems ⋮ Sturmian graphs and integer representations over numeration systems ⋮ The carry propagation of the successor function ⋮ A Fibonacci analogue of the two’s complement numeration system ⋮ First-Order Logic and Numeration Systems ⋮ Unnamed Item ⋮ Redundancy of minimal weight expansions in Pisot bases ⋮ Representations for complex numbers with integer digits ⋮ Trees and languages with periodic signature ⋮ \(k\)-block parallel addition versus 1-block parallel addition in non-standard numeration systems ⋮ Robustness of Pisot-regular sequences ⋮ Parallel addition in non-standard numeration systems ⋮ The signature of rational languages ⋮ Minimal automaton for multiplying and translating the Thue-Morse set ⋮ On Lazy Representations and Sturmian Graphs ⋮ Substitutive number systems ⋮ Regular sequences and synchronized sequences in abstract numeration systems ⋮ Finite transducers and rational transductions ⋮ Unnamed Item ⋮ An analogue of Cobham's theorem for graph directed iterated function systems
This page was built for publication: Number representation and finite automata
