论文信息 - SOME RESULTS OF IMPLEMENTED ALGORITHMS OF SYNCHRONIZATION

SOME RESULTS OF IMPLEMENTED ALGORITHMS OF SYNCHRONIZATION

A word w is called synchronizing (recurrent, reset) word of an automaton if w sends all states of the automaton on a unique state. A kind of a necessary and su cient conditions of synchronizeability of an arbitrary deterministic nite automaton is found. It is a base for an implemented quadric algorithm. Some results of known and new implemented algorithms nding synchronizing word are compared. (http://www.cs.biu.ac.il/ trakht/Testas.html).

A. N. Trahtman

[1] Balas K. Natarajan. An algorithmic approach to the automated design of parts orienters , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[2] Mikhail V. Volkov,et al. Collapsing Words vs. Synchronizing Words , 2001, Developments in Language Theory.

[3] J. Kari. A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata , 2001, Bull. EATCS.

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

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

[6] Arto Salomaa,et al. Generation of Constants and Synchronization of Finite Automata , 2002, J. Univers. Comput. Sci..

[7] P. FRANKL,et al. An Extremal Problem for two Families of Sets , 1982, Eur. J. Comb..

[8] Avraham Trakhtman. Optimal Estimation on the Order of Local Testability of Finite Automata , 2000, Theor. Comput. Sci..