Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. M. Ajtai, R. Fagin, L.J. Stockmeyer, The closure of monadic NP, Research Report RJ 10092, IBM, December 1997.
2. M. Ajtai, R. Fagin, L.J. Stockmeyer, The closure of monadic NP, The Thirtieth Ann. ACM Symp. on Theory of Computing, SIGACT, 1998, pp. 309–318.
3. The dot-depth hierarchy of star-free languages is infinite;Brzozowski;J. CSS,1971
4. Finite automata and unary languages;Chrobak;Theoret. Comput. Sci.,1986
5. Two-dimensional languages and recognizable functions;Giammarresi,1994
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献