Synchronizing Automata and the Cerny Conjecture

By Mikhail Volkov. Language and Automata Theory and Applications, 2008

295 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/169df37749a1ff44d81b8d81a3806eb1e204da87

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. J. Ara'ujo
2. Ben Steinberg
3. Peter J. Cameron
4. Mark V. Lawson
5. L. O. Clark
6. Aidan Sims
7. Enrique Pardo
8. R. Exel

In Molecular Biology

1. J. Ara'ujo
2. Ben Steinberg
3. Peter J. Cameron

Citations in the corpus

• Combinatorial algebra : syntax and semantics (2014, unknown): “As Adler, Goodwyn and Weiss, we shall consider only strongly connected graphs (this is not a very restrictive assumption, see Volkov [327].”
• Between primitive and 2-transitive: Synchronization and its friends (2015, methodology): “In 1969, Černý made the following conjecture (see [108]):”