Author:
Berstel Jean,Carton Olivier
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)
2. Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189–196. Academic Press, London (1971)
3. Krivol, S.L.: Algorithms for minimization of finite acyclic automata and pattern matching in terms. Cybernetics 27, 324–331 (1991); Translated from Kibernetika 3, 11–16 (May-June 1991)
4. Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theoret. Comput. Sci. 92, 181–189 (1992)
5. Lecture Notes in Computer Science;J. Daciuk,2003
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献