论文信息 - On Synchronizing Unambiguous Automata

On Synchronizing Unambiguous Automata

We give a polynomial upper bound for the length of the shortest word of minimal rank in a transitive n-state unambiguous automation whose transition monoid does not contain the null relation. In particular, in an n-state synchronizing unambiguous automation there is a synchronizing word of length less than 12n3.

Arturo Carpi | A. Carpi

[1] M. Schützenberger,et al. Sur certains sous-monoïdes libres , 1965 .

[2] Jean-Eric Pin,et al. Le problème de la synchronisation et la conjecture de Cerný , 1981 .

[3] J. Berstel,et al. Theory of codes , 1985 .

[4] M. Paterson. Unsolvability in 3 × 3 Matrices , 1970 .

[5] Peter H. Starke. Eine Bemerkung über homogene Experimente , 1966, J. Inf. Process. Cybern..

[6] Václav Koubek,et al. A Game of Composing Binary Relations , 1982, RAIRO Theor. Informatics Appl..

[7] Denis J Kfoury. Synchronizing Sequences for Probabilistic Automata , 1970 .