A note o? Cern´yCern´y's conjecture and rational series, 2003. ,
A quadratic algorithm for road coloring, CoRR, abs/0803, p.726, 2008. ,
Shortest synchronizing strings for Huffman codes, MFCS, pp.120-131, 2008. ,
The Synchronization Problem for Strongly Transitive Automata, Developments in Language Theory, pp.240-251, 2008. ,
DOI : 10.1007/978-3-540-85780-8_19
Poznámka k. homogénnym experimentom s konecn´ymikonecn´ymi automatmi, pp.208-215, 1964. ,
Almost all complete binary prefix codes have a self-synchronizing string, IEEE Transactions on Information Theory, vol.49, issue.9, pp.49-2219, 2003. ,
DOI : 10.1109/TIT.2003.815803
A counter example to a conjecture concerning synchronizing words in finite automata, Synchronizing finite automata on Eulerian digraphs MFCS'2001, no. 2136 in LNCS, pp.146-432, 2001. ,
Synchronizing prefix codes and automata and the road coloring problem, Symbolic Dynamics and its Applications, pp.295-318, 1992. ,
DOI : 10.1090/conm/135/1185096
13. , Sur un cas particulier de la conjecture d? Cern´yCern´y, 5th ICALP, no. 62 in LNCS On two combinatorial problems arising from automata theory, Annals of Discrete Mathematics, pp.345-352, 1978. ,
URL : https://hal.archives-ouvertes.fr/inserm-00139064
On synchronizing prefix codes, Information and Control, vol.11, issue.4, pp.396-401, 1967. ,
DOI : 10.1016/S0019-9958(67)90620-1
Synchronization of some DFA, in TAMC, pp.234-243, 2007. ,
The road coloring problem, Israel Journal of Mathematics, vol.17, issue.1, 2008. ,
DOI : 10.1007/s11856-009-0062-5
Some Aspects of Synchronization of DFA, Journal of Computer Science and Technology, vol.172, issue.1/2, pp.719-727, 2008. ,
DOI : 10.1007/s11390-008-9165-4
Synchronizing automata preserving a chain of partial orders, CIAA Synchronizing automata and th? Cerny conjecture LATA, pp.27-37, 2007. ,