On-line odometers for two-sided symbolic dynamical systems

Authors:
Christiane Frougny
Affiliations:
LIAFA, Paris Cedex 05, France and Université Paris 8
Venue:
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Year:
2002

Citing 6
Cited 1

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
On the sequentiality of the successor function

Information and Computation
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 digit set conversion in real base

Theoretical Computer Science

On alpha-adic expansions in Pisot bases

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider biinfinite sequences on a finite alphabet of digits which satisfy a constraint of finite type. Such sequences are perturbed by adding a 1 in position 0. The odometer is the function which transforms the initial sequence into an admissible sequence equivalent to the perturbed one. It is shown that the odometer can be realized by an on-line finite automaton when the constraint is linked to numeration in base β, where β is a Pisot number satisfying the equation βm = t1βm-1+...+tm, where t1 ≥ t2 = ... tm ≥ 1 are integers.