On the bound of the synchronization delay of a local automaton
✍ Scribed by Marie-Pierre Béal; Jean Senellart
- Book ID
- 104326671
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 600 KB
- Volume
- 205
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
The synchronization delay of an N-state local automaton is known to be 0(N2). It has been conjectured by Kim et al. (1991) that, for deterministic local automata, it is O(N") on a twoletter alphabet and no less than O(N2) in the general case. We prove that this conjecture is false and that the synchronization delay is n(N*) in all cases.
📜 SIMILAR VOLUMES
A forced scalar delay dynamical system is analyzed from the perspective of bifurcation and synchronization. In general first order differential equations do not exhibit chaos, but introduction of a delay feedback makes the system infinite dimensional and shows chaoticity. In order to study the dynam