An algorithm for road coloring
暂无分享,去创建一个
[1] Jürgen Duske,et al. On cofinal and definite automata , 1983, Acta Cybern..
[2] Vladimir V. Gusev,et al. Slowly Synchronizing Automata and Digraphs , 2010, MFCS.
[3] A. N. Trahtman,et al. Notable trends concerning the synchronization of graphs and automata , 2006 .
[4] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[5] Benjamin Weiss,et al. SIMILARITY OF AUTOMORPHISMS OF THE TORUS , 1970 .
[6] Benjamin Weiss,et al. Equivalence of topological Markov shifts , 1977 .
[7] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[8] Adam Roman. Decision Version of the Road Coloring Problem Is NP-Complete , 2009, FCT.
[9] Kamal Jain,et al. A Min-Max theorem about the Road Coloring Conjecture , 2005 .
[10] Balázs Imreh,et al. Some Remarks on Directable Automata , 1995, Acta Cybern..
[11] Jarkko Kari,et al. A Note on Synchronized Automata and Road Coloring Problem , 2001, Developments in Language Theory.
[12] A. N. Trahtman. A package TESTAS for checking some kinds of testability , 2002, CIAA'02.
[13] Avraham Trakhtman,et al. Linear Visualization of a Road Coloring , 2010, CTW.
[14] Alessandra Carbone. Cycles of relatively prime length and the road coloring problem , 2001 .
[16] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[17] Edward F. Schmeichel,et al. A Note on the Road-Coloring Conjecture , 1998, Ars Comb..
[18] Avraham Trakhtman. A Package TESTAS for Checking Some Kinds of Testability , 2002, CIAA.
[19] A. Trahtman. Synchronizing Road Coloring , 2008 .
[20] A. N. Trahtman,et al. The road coloring problem , 2007, 0709.0099.
[21] Flavio D'Alessandro,et al. The Synchronization Problem for Strongly Transitive Automata , 2008, Developments in Language Theory.
[22] Avraham Trakhtman. A Subquadratic Algorithm for Road Coloring , 2008, ArXiv.
[23] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[24] Avraham Trakhtman,et al. The Road Coloring and Cerny Conjecture , 2008, Stringology.
[25] Arto Salomaa,et al. Many-Valued Truth Functions, Cerny's Conjecture and Road Coloring , 1999, Bull. EATCS.
[26] Natasa Jonoska,et al. A molecular computation of the road coloring problem , 1996, DNA Based Computers.
[27] I. K. Rystsov. Quasioptimal Bound for the Length of Reset Words for Regular Automata , 1995, Acta Cybern..
[28] Jorge Almeida,et al. Matrix Mortality and the Cerný-Pin Conjecture , 2009, Developments in Language Theory.
[29] Ján Cerný,et al. On directable automata , 1971, Kybernetika (Praha).
[30] J. Pin. On two Combinatorial Problems Arising from Automata Theory , 1983 .
[31] Dominique Perrin,et al. A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata , 2009, Developments in Language Theory.
[32] G. O'Brien,et al. The road-colouring problem , 1981 .
[33] Jarkko Kari,et al. Synchronizing Finite Automata on Eulerian Digraphs , 2003, MFCS.