论文信息 - Reset Words for Commutative and Solvable Automata

Reset Words for Commutative and Solvable Automata

Abstract A reset word takes all states of a finite automaton to a single state. In this paper, it is shown that the length of the shortest reset word for a solvable automaton with n states is at most n − 1 and this bound is reachable.

I. K. Rystsov | I. Rystsov

[1] Dimitr B. Siskov. Minimization of finite automata , 1972, Kybernetika.

[2] Jean-Éric Pin,et al. Sur un Cas Particulier de la Conjecture de Cerny , 1978, ICALP.

[3] Balázs Imreh. On finite definite automata , 1985, Acta Cybern..

[4] Micha A. Perles,et al. The Theory of Definite Automata , 1963, IEEE Trans. Electron. Comput..

[5] David Eppstein,et al. Reset Sequences for Monotonic Automata , 1990, SIAM J. Comput..

[6] I. K. Rystsov,et al. In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton , 1987 .

[7] Balázs Imreh,et al. Some Remarks on Directable Automata , 1995, Acta Cybern..