Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;A. Badr,2008
2. Badr, A.: Hyper-minimization in O(n
2). Int. J. Found. Comput. Sci. 20(4), 735–746 (2009)
3. Badr, A., Geffert, V., Shipman, I.: Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Inf. Appl. 43(1), 69–94 (2009)
4. Eppstein, D.: Finding common ancestors and disjoint paths in DAGs. Tech. Rep. 95-52, University of California, Irvine (1995)
5. Lecture Notes in Computer Science;P. Gawrychowski,2009
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION;International Journal of Foundations of Computer Science;2012-09
2. On Minimising Automata with Errors;Mathematical Foundations of Computer Science 2011;2011