Computability by finite automata and Pisot bases
Mathematical Systems Theory
Deterministic synchronization of automations with bounded delay
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Some Characterizations of Functions Computable in On-Line Arithmetic
IEEE Transactions on Computers
On-line odometers for two-sided symbolic dynamical systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Hi-index | 5.23 |
Let β be a real number 1. The digit set conversion between real numbers represented in fixed base β is shown to be computable by an on-line algorithm, and thus is a continuous function. When β is a Pisot number the digit set conversion is computable by an on-line finite automaton.