| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4624830 | Advances in Applied Mathematics | 2013 | 17 Pages |
Abstract
The synchronization problem is investigated for the class of locally strongly transitive automata introduced in Carpi and DʼAlessandro (2009) [9]. Some extensions of this problem related to the notions of stable set and word of minimal rank of an automaton are studied. An application to synchronizing colorings of aperiodic graphs with a Hamiltonian path is also considered.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
