| Server | START Conference Manager |
| Update Time | 20 Feb 2006 at 20:05:03 |
| Maintainer | zdang@eecs.wsu.edu. |
Conference Systems |
We introduce $\alpha$-synchronous relations for a rational number~$\alpha$. We show that if a rational relation is both $\alpha$- and $\alpha'$-synchronous for two different numbers $\alpha$ and~$\alpha'$, then it is recognizable. We give a synchronization algorithm for $\alpha$-synchronous transducers. We also prove the closure under boolean operations and composition of $\alpha$-synchronous relations.
|
|