The synchronization problem is investigated for a new class of deterministic automata called locally strongly transitive. An application to synchronizing colorings of aperiodic graphs with a cycle of prime length is also considered. © 2009 Springer Berlin Heidelberg.
The synchronization problem for locally strongly transitive automata / Arturo, Carpi; D'Alessandro, Flavio. - STAMPA. - 5734 LNCS:(2009), pp. 211-222. (Intervento presentato al convegno 34th International Symposium on Mathematical Foundations of Computer Science 2009, MFCS 2009 tenutosi a Novy Smokovec; Slovakia nel 24 August 2009 through 28 August 2009) [10.1007/978-3-642-03816-7_19].
The synchronization problem for locally strongly transitive automata
D'ALESSANDRO, Flavio
2009
Abstract
The synchronization problem is investigated for a new class of deterministic automata called locally strongly transitive. An application to synchronizing colorings of aperiodic graphs with a cycle of prime length is also considered. © 2009 Springer Berlin Heidelberg.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
