Author:
Yue Jumei,Yan Yongyi,Chen Zengqiang
Publisher
Springer Science and Business Media LLC
Reference10 articles.
1. Almeida J, Zeitoun M. Description and analysis of a bottom-up DFA minimization algorithm. Inf Process Lett, 2008, 107: 52–59
2. David J. The average complexity of Moore’s state minimization algorithm is O(nloglogn). Lect Notes Comput Sci, 2010, 6281: 318–329
3. Peeva K. Equivalence, reduction and minimization of finite automata over semirings. Theory Comput Sci, 1991, 88: 269–285
4. Lamperti G, Scandale M. Incremental determinization and minimization of finite acyclic automata. In: Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, 2013. 2250–2257
5. Holzer M, Kutrib M. Descriptional and computational complexity of finite automata: a survey. Inf Comput, 2011, 209: 456–470
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献