Publisher
Springer International Publishing
Reference25 articles.
1. Björklund, H., Martens, W.: The tractability frontier for NFA minimization. J. Comput. Syst. Sci. 78(1), 198–210 (2012)
2. Bubenzer, J.: Cycle-aware minimization of acyclic deterministic finite-state automata. Discrete Appl. Math. 163, 238–246 (2014)
3. Chan, T.-H., Ibarra, O.: On the finite valuedness problem for sequential machines. Theoret. Comput. Sci. 23, 95–101 (1983)
4. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献