论文信息 - The growth ratio of synchronous rational relations is unique

The growth ratio of synchronous rational relations is unique

We introduce @a-synchronous relations for a rational number @a. We show that if a rational relation is both @a- and @a^'-synchronous for two different numbers @a and @a^', then it is recognizable. We give a synchronization algorithm for @a-synchronous transducers. We also prove the closure under boolean operations and composition of @a-synchronous relations.

Olivier Carton

[1] Sasha Rubin,et al. Automatic Structures: Overview and Future Directions , 2003, J. Autom. Lang. Comb..

[2] Jorge E. Mezei,et al. On Relations Defined by Generalized Finite Automata , 1965, IBM J. Res. Dev..

[3] J. Sakarovitch. Eléments de théorie des automates , 2003 .

[4] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5] Alan Cobham,et al. On the base-dependence of sets of numbers recognizable by finite automata , 1969, Mathematical systems theory.

[6] Berndt Farwer,et al. ω-automata , 2002 .

[7] Brian Marcus,et al. Factors and extensions of full shifts , 1979 .

[8] Don Coppersmith,et al. Algorithms for sliding block codes - An application of symbolic dynamics to information theory , 1983, IEEE Trans. Inf. Theory.

[9] Jacques Sakarovitch,et al. Synchronized Rational Relations of Finite and Infinite Words , 1993, Theor. Comput. Sci..