An efficient algorithm finds noticeable trends and examples concerning the Černy conjecture
暂无分享,去创建一个
[1] Ján Cerný,et al. On directable automata , 1971, Kybernetika (Praha).
[2] Avraham Trakhtman. Optimal Estimation on the Order of Local Testability of Finite Automata , 2000, Theor. Comput. Sci..
[3] J. Pin. On two Combinatorial Problems Arising from Automata Theory , 1983 .
[4] David Eppstein,et al. Reset Sequences for Monotonic Automata , 1990, SIAM J. Comput..
[5] Zvi Kohavi,et al. Establishing Certain Bounds Concerning Finite Automata , 1973, J. Comput. Syst. Sci..
[6] Carl Pixley,et al. Minimum Length Synchronizing Sequences of Finite State Machine , 1993, 30th ACM/IEEE Design Automation Conference.
[7] Jarkko Kari,et al. A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata , 2001, Bull. EATCS.
[8] P. FRANKL,et al. An Extremal Problem for two Families of Sets , 1982, Eur. J. Comb..
[9] Sam M. Kim,et al. A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata , 1989, IEEE Trans. Computers.
[10] Alessandra Cherubini,et al. An Inverse Automata Algorithm for Recognizing 2-Collapsing Words , 2002, Developments in Language Theory.
[11] Arto Salomaa,et al. Generation of Constants and Synchronization of Finite Automata , 2002, J. Univers. Comput. Sci..
[12] David Lee,et al. Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.
[13] Balas K. Natarajan. An algorithmic approach to the automated design of parts orienters , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).