Talk abstract:

Deterministic Synchronization of Bounded Delay 2-tape Finite Automata

Christiane Frougny
LIAFA - Case 7014, 2 place Jussieu
75251 Paris Cedex 05 - France
Christiane.Frougny@liafa.jussieu.fr
http://www.liafa.jussieu.fr/~cf

(joint work with Jacques Sakarovitch).

It is shown that a 2-tape finite automaton, deterministic on inputs and with bounded delay, is equivalent to an on-line automaton, that is an automaton which is letter-to-letter after an initial period where it reads the input and output nothing, and still deterministic on inputs. This construction has some applications to number representation and computer arithmetic.

Back to Codes, Systems and Graphical Models