Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Automata, Languages, and Machines
Automata, Languages, and Machines
Automatic structures: overview and future directions
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
On relations defined by generalized finite automata
IBM Journal of Research and Development
Algorithms for sliding block codes---An application of symbolic dynamics to information theory
IEEE Transactions on Information Theory
Deciding word neighborhood with universal neighborhood automata
Theoretical Computer Science
| Hi-index | 5.23 |
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.