| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436184 | Theoretical Computer Science | 2007 | 8 Pages |
Abstract
We introduce α-synchronous relations for a rational number α. We show that if a rational relation is both α- and α′-synchronous for two different numbers α and α′, then it is recognizable. We give a synchronization algorithm for α-synchronous transducers. We also prove the closure under boolean operations and composition of α-synchronous relations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
