Skip to main content
Conference Proceedings

The synchronization problem for locally strongly transitive automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5734 LNCS 211-222
DOI: 10.1007/978-3-642-03816-7_19
12Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Carpi, A., & D’Alessandro, F. (2009). The synchronization problem for locally strongly transitive automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5734 LNCS, pp. 211–222). https://doi.org/10.1007/978-3-642-03816-7_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free