Variants of the road coloring problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Variants of the road coloring problem

Dominique Perrin

Résumé

The road coloring problem has been solved by Trahtman recently. In this talk, I will discuss its relation with other problems concerning synchronized automata, in particular in connexion with the commutative equivalence. I will present a proof, due to M.P. Schutzenberger, of the fact that any finite maximal prefix code is commutatively equivalent to a synchronized one.
Fichier non déposé

Dates et versions

hal-00620455 , version 1 (07-09-2011)

Identifiants

  • HAL Id : hal-00620455 , version 1

Citer

Dominique Perrin. Variants of the road coloring problem. Journées Montoises d'Informatique Théorique, 2008, France. ⟨hal-00620455⟩
46 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More