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. (C) 2012 Elsevier Inc. All rights reserved.
Independent sets of words and the synchronization problem / D'Alessandro, Flavio; Arturo, Carpi. - In: ADVANCES IN APPLIED MATHEMATICS. - ISSN 0196-8858. - STAMPA. - 50:3(2013), pp. 339-355. [10.1016/j.aam.2012.07.003]
Independent sets of words and the synchronization problem
D'ALESSANDRO, Flavio;
2013
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. (C) 2012 Elsevier Inc. All rights reserved.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
