The Synchronization Problem for Locally Strongly Transitive Automata

Authors:
Arturo Carpi;Flavio D'Alessandro
Affiliations:
Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Perugia, Italy 06123;Dipartimento di Matematica, Università di Roma "La Sapienza", Roma, Italy 00185
Venue:
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Year:
2009

Citing 0
Cited 3

On the hybrid Černý-road coloring problem and Hamiltonian paths

DLT'10 Proceedings of the 14th international conference on Developments in language theory
The averaging trick and the Černý conjecture

DLT'10 Proceedings of the 14th international conference on Developments in language theory
The Synchronizing Probability Function of an Automaton

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.