Synchronizing finite automata on Euleria
β
Jarkko Kari
π
Article
π
2003
π
Elsevier Science
π
English
β 126 KB
Γ CernΓ y's conjecture and the road coloring problem are two open problems concerning synchronization of ΓΏnite automata. We prove these conjectures in the special case that the vertices have uniform in-and outdegrees.