Subject
General Computer Science,Theoretical Computer Science
Reference9 articles.
1. Z. Dang, O. Ibarra, Z. Sun, On the emptiness problems for two-way nfa with one reversal-bounded counter, in: Proc. 13th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2518, Springer, Berlin, 2002, pp. 103–114.
2. Semigroups, presburger formulas, and languages;Ginsburg;Pacific J. Math.,1966
3. The complexity of decision problems for finite-turn multicounter machines;Gurari;J. Comput. Sys. Sci.,1981
4. Two-way counter machines and diophantine equations;Gurari;J. ACM,1982
5. Reversal-bounded multicounter machines and their decision problems;Ibarra;J. ACM,1978
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献