Independent sets of words and the synchronization problem

The synchronization problem is investigated for the class of locally strongly transitive automata introduced in Carpi and [email protected]?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.

[1]  Vladimir V. Gusev,et al.  Slowly Synchronizing Automata and Digraphs , 2010, MFCS.

[2]  Mikhail V. Volkov,et al.  Synchronizing generalized monotonic automata , 2005, Theor. Comput. Sci..

[3]  Carl V. Page,et al.  Equivalences between Probalistic and Deterministic Sequential Machines , 1966, Inf. Control..

[4]  Benjamin Steinberg,et al.  The Averaging Trick and the černý Conjecture , 2009, Int. J. Found. Comput. Sci..

[5]  Jean-Eric Pin,et al.  Le problème de la synchronisation et la conjecture de Cerný , 1981 .

[6]  Avraham Trakhtman,et al.  The Černý Conjecture for Aperiodic Automata , 2021, Discret. Math. Theor. Comput. Sci..

[7]  Dominique Perrin,et al.  A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata , 2009, Developments in Language Theory.

[8]  P. FRANKL,et al.  An Extremal Problem for two Families of Sets , 1982, Eur. J. Comb..

[9]  Flavio D'Alessandro,et al.  On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths , 2010, Developments in Language Theory.

[10]  Jarkko Kari,et al.  Synchronizing Finite Automata on Eulerian Digraphs , 2003, MFCS.

[11]  Jean-Éric Pin,et al.  Sur un Cas Particulier de la Conjecture de Cerny , 1978, ICALP.

[12]  이영식.  Communication 으로서의 영어교육 , 1986 .

[13]  I. K. Rystsov,et al.  Almost optimal bound of recurrent word length for regular automata , 1995 .

[14]  Benjamin Steinberg,et al.  The Černý conjecture for one-cluster automata with prime length cycle , 2010, Theor. Comput. Sci..

[15]  Jarkko Kari,et al.  A Note on Synchronized Automata and Road Coloring Problem , 2001, Developments in Language Theory.

[16]  Arturo Carpi,et al.  On Synchronizing Unambiguous Automata , 1988, Theor. Comput. Sci..

[17]  G. O'Brien,et al.  The road-colouring problem , 1981 .

[18]  Flavio D'Alessandro,et al.  Strongly transitive automata and the Černý conjecture , 2009, Acta Informatica.

[19]  Flavio D'Alessandro,et al.  The Synchronization Problem for Locally Strongly Transitive Automata , 2009, MFCS.

[20]  Benjamin Weiss,et al.  Equivalence of topological Markov shifts , 1977 .

[21]  Mikhail V. Volkov,et al.  Synchronizing Automata and the Cerny Conjecture , 2008, LATA.

[22]  L. Dubuc,et al.  Sur Les Automates Circulaires et la Conjecture de Cerný , 1998, RAIRO Theor. Informatics Appl..

[23]  A. N. Trahtman,et al.  The road coloring problem , 2007, 0709.0099.