Skip to main content
SpringerLink
Log in

On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Included in the following conference series:

Abstract

We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e., the counter alternates between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e., subsets of w 1 * ...w k * for some nonnull words w1,..., w k) is decidable, settling an open problem in [11,12]. The proof is a rather involved reduction to the solution of a special class of Diophantine systems of degree 2 via a class of programs called two-phase programs. The result has applications to verification of infinite state systems.

The work by Oscar H. Ibarra has been supported in part by NSF Grant IIS-0101134.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Brauer. On a problem of partitions. Amer. J. Math., 64:299–312, 1942.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  7. A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. InProc. 17thAnn. 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.

    Google Scholar 

  8. S. Ginsburg and E. Spanier. Semigroups, Presburger formulas, and languages. Pacific J. of Mathematics, 16:285–296, 1966.

    MATH  MathSciNet  Google Scholar 

  9. E. M. Gurari and O. H. Ibarra. The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences, 22:220–229, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  10. E. M. Gurari and O. H. Ibarra. Two-way counter machines and Diophantine equations. Journal of the ACM, 29(3):863–873, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  11. O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM, 25(1):116–133, January 1978.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Chapter  Google Scholar 

  14. R. Kannan. Lattice translates of a polytope and the Frobenius problem. Combinatorica, 12:161–177, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  15. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Norwell Massachusetts, 1993.

    MATH  Google Scholar 

  16. L. Lipshitz. The Diophantine problem for addition and divisibility. Transactions of AMS, 235:271–283, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  17. K. Mahler. On the Chinese remainder theorem. Math. Nachr., 18:120–122, 1958.

    MATH  MathSciNet  Google Scholar 

  18. Y. V. Matiyasevich. Hilbert’s Tenth Problem. MIT Press, 1993.

    Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  20. J. L. Ramirez-Alfonsin. Complexity of the Frobenius problem. Combinatorica, 16:143–147, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  21. A. P. Sistla and E. M. Clarke. Complexity of propositional temporal logics. Journal of ACM, 32(3):733–749, 1983.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99164, USA

    Zhe Dang

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  3. Department of Mathematics, Nanjing University, Nanjing, 210093, China

    Zhi-Wei Sun

Authors
  1. Zhe Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhi-Wei Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dang, Z., Ibarra, O.H., Sun, ZW. (2002). On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation