메뉴 건너뛰기
Theoretical Computer Science
Volumn 312, Issue 2-3, 2004, Pages 359-378
On two-way FA with monotonic counters and quadratic Diophantine equations
Author keywords

Decidability; Monotonic counter; Presburger relation; Quadratic Diophantine equation; Reachability problem; Semilinear set; Two way finite automaton
Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; INTEGER PROGRAMMING; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SET THEORY; THEOREM PROVING;
EID: 0348230616     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.027     Document Type: Article
Times cited : (9)
References (9)
  • 1
    • 23044532332 scopus 로고    scopus 로고
    • On the emptiness problems for two-way nfa with one reversal-bounded counter
    • Proc. 13th Internat. Symp. on Algorithms and Computation, Springer, Berlin
    • 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.
    • (2002) Lecture Notes in Computer Science , vol.2518 , pp. 103-114
    • Dang, Z.1    Ibarra, O.2    Sun, Z.3
  • 2
    • 84972499908 scopus 로고
    • Semigroups, presburger formulas, and languages
    • Ginsburg S., Spanier E. Semigroups, presburger formulas, and languages. Pacific J. Math. 16:1966;285-296.
    • (1966) Pacific J. Math. , vol.16 , pp. 285-296
    • Ginsburg, S.1    Spanier, E.2
  • 3
    • 0019549914 scopus 로고
    • The complexity of decision problems for finite-turn multicounter machines
    • Gurari E.M., Ibarra O.H. The complexity of decision problems for finite-turn multicounter machines. J. Comput. Sys. Sci. 22:1981;220-229.
    • (1981) J. Comput. Sys. Sci. , vol.22 , pp. 220-229
    • Gurari, E.M.1    Ibarra, O.H.2
  • 4
    • 0020160105 scopus 로고
    • Two-way counter machines and diophantine equations
    • Gurari E.M., Ibarra O.H. Two-way counter machines and diophantine equations. J. ACM. 29(3):1982;863-873.
    • (1982) J. ACM , vol.29 , Issue.3 , pp. 863-873
    • Gurari, E.M.1    Ibarra, O.H.2
  • 5
    • 84976713661 scopus 로고
    • Reversal-bounded multicounter machines and their decision problems
    • Ibarra O.H. Reversal-bounded multicounter machines and their decision problems. J. ACM. 25(1):1978;116-133.
    • (1978) J. ACM , vol.25 , Issue.1 , pp. 116-133
    • Ibarra, O.H.1
  • 6
    • 0029244263 scopus 로고
    • New decidability results concerning two-way counter machines
    • Ibarra O.H., Jiang T., Tran N., Wang H. New decidability results concerning two-way counter machines. SIAM J. Comput. 24:1995;123-137.
    • (1995) SIAM J. Comput. , vol.24 , pp. 123-137
    • Ibarra, O.H.1    Jiang, T.2    Tran, N.3    Wang, H.4
  • 7
    • 84968503336 scopus 로고
    • The diophantine problem for addition and divisibility
    • Lipshitz L. The diophantine problem for addition and divisibility. Trans. AMS. 235:1978;271-283.
    • (1978) Trans. AMS , vol.235 , pp. 271-283
    • Lipshitz, L.1
  • 9
    • 0001699148 scopus 로고
    • Recursive unsolvability of post's problem of tag and other topics in the theory of turing machines
    • Minsky M. Recursive unsolvability of post's problem of tag and other topics in the theory of turing machines. Ann. Math. 74:1961;437-455.
    • (1961) Ann. Math. , vol.74 , pp. 437-455
    • Minsky, M.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.