Abstract
Černý’s conjecture and the road coloring problem are two open problems concerning synchronizing finite automata. We prove these conjectures in the special case that the underlying digraph is Eulerian, that is, if the in- and out-degrees of all vertices are equal.
Research supported by NSF Grant CCR 97-33101
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. L. Adler, L. W. Goodwyn, B. Weiss. Equivalence of topological Markov shifts. Israel Journal of Mathematics 27 (1977), 49–63.
R. L. Adler, B. Weiss. Similarity of automorphisms of the torus. Memoires of the American Mathematical Society, n. 98. 1970.
J. Černý. Poznámka k. homogénnym experimenton s konečnými automatmi. Mat. fyz. čas SAV 14 (1964), 208–215.
K. Culik, J. Karhumäki, J. Kari. Synchronized automata and the road coloring problem. TUCS technical report 323. Turku Centere for Computer Science, University of Turku, 1999.
J. Friedman. On the road coloring problem. Proceedings of the American Mathematical Society 110 (1990), 1133–1135.
G. L. O’Brien. The road coloring problem. Israel Journal of Mathematics 39 (1981), 145–154.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kari, J. (2001). Synchronizing Finite Automata on Eulerian Digraphs. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_38
Download citation
DOI: https://doi.org/10.1007/3-540-44683-4_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42496-3
Online ISBN: 978-3-540-44683-5
eBook Packages: Springer Book Archive