On the emptiness problem for two-way NFA with one reversal-bounded counter

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 103-114

  Dang, Zhe ^a   Ibarra, Oscar H ^b   Sun, Zhi Wei ^c  

^a Washington State University   (United States)

^b University of California   (United States)

^c NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED LANGUAGE; DIOPHANTINE SYSTEM; EMPTINESS PROBLEM; FIXED NUMBERS; NONDETERMINISTIC FINITE AUTOMATON; REVERSAL-BOUNDED COUNTERS; SPECIAL CLASS; VERIFICATION OF INFINITE-STATE SYSTEMS;

FINITE AUTOMATA;

ALGORITHMS; PIPELINE PROCESSING SYSTEMS;

EID: 23044532332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_10     Document Type: Conference Paper

References (22)

1. A. Brauer. On a problem of partitions. Amer. J. Math., 64:299-312, 1942.
2. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop of Logic of Programs, volume 131 of Lecture Notes in Computer Science. Springer, 1981.
3. E. M. Clarke, E.A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986. (Pubitemid 16633197)
4. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proc. 10th Int. Conf. Computer Aided Verification (CAV'98), volume 1427 of Lecture Notes in Computer Science, pages 268-279. Springer, 1998. (Pubitemid 128092345)
5. H. Comon and Y. Jurski. Timed automata and the theory of real numbers. In Proc. 10th Int. Conf. Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in Computer Science, pages 242-257. Springer, 1999.
6. Zhe Dang, O. H. Ibarra, and R. A. Kemmerer. Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. In Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON'01), volume 2108 of Lecture Notes in Computer Science, pages 529-539. Springer, 2001. (Pubitemid 33325586)
7. A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS'2000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 346-357. Springer, 2000.
8. S. Ginsburg and E. Spanier. Semigroups, Presburger formulas, and languages. Pacific J. of Mathematics, 16:285-296, 1966.
9. E. M. Gurari and O. H. Ibarra. The complexity of decision problems for finite-turn multi-counter machines. Journal of Computer and System Sciences, 22:220-229, 1981.
10. E.M. Gurari and O.H. Ibarra. Two-waycounter machines and Diophantine equations. Journal of the ACM, 29(3):863-873, 1982.
11. O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116-133, January 1978.
12. O. H. Ibarra, T. Jiang, N. Tran, and H. Wang. New decidability results concerning two-way counter machines. SIAM J. Comput., 24:123-137, 1995.
13. O. H. Ibarra, J. Su, Zhe Dang, T. Bultan, and R. A. Kemmerer. Counter machines: decidable properties and applications to verification problems. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS 2000), volume 1893 of Lecture Notes in Computer Science, pages 426-435. Springer-Verlag, 2000.
14. R. Kannan. Lattice translates of a polytope and the Frobenius problem. Combinatorica, 12:161-177, 1992.
15. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.
16. L. Lipshitz. The Diophantine problem for addition and divisibility. Transactions of AMS, 235:271-283, 1978.
17. K. Mahler. On the Chinese remainder theorem. Math. Nachr., 18:120-122, 1958.
18. Y. V. Matiyasevich. Hilbert's Tenth Problem. MIT Press, 1993.
19. M. Minsky. Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines. Ann. of Math., 74:437-455, 1961.
20. J. L. Ramirez-Alfonsin. Complexity of the Frobenius problem. Combinatorica, 16:143-147, 1996. (Pubitemid 126059582)
21. A. P. Sistla and E. M. Clarke. Complexity of propositional temporal logics. Journal of ACM, 32(3):733-749, 1983.
22. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proceedings 1st Annual IEEE Symp. on Logic in Computer Science, LICS'86, Cambridge, MA, USA, 16-18 June 1986, pages 332-344, Washington, DC, 1986. IEEE Computer Society Press. (Pubitemid 17563569)