Publisher
Springer Nature Switzerland
Reference20 articles.
1. Birget, J.C.: Intersection and union of regular languages and state complexity. Inform. Process. Lett. 43, 185–190 (1992)
2. Blass, A., Gurevich, Y.: On the unique satisfiability problem. Inf. Control 55, 80–88 (1982)
3. Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. J. ACM 21, 114–133 (1981)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)
5. Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inform. Process. Lett. 59, 75–77 (1996)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity of Unary Exclusive Nondeterministic Finite Automata;Electronic Proceedings in Theoretical Computer Science;2024-09-11