Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Descriptional Complexity of Formal Systems

DCFS 2014: Descriptional Complexity of Formal Systems pp 5–22Cite as

Automata with Reversal-Bounded Counters: A Survey

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8614))

Abstract

We survey the properties of automata augmented with reversal-bounded counters. In particular, we discuss the closure/non-closure properties of the languages accepted by these machines as well as the decidability/undecidability of decision problems concerning these devices. We also give applications to several problems in automata theory and formal languages.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proc. of STOC 2004, pp. 202–211 (2004)

    Google Scholar 

  2. Alur, R., Cerny, P.: Expressiveness of streaming string transducers. In: Proc. 30th Annual Conf. on Foundations of Software Technology and Theoretical Computer Science, pp. 1–12 (2010)

    Google Scholar 

  3. Alur, R., Deshmukh, J.: Nondeterministic streaming string transducers. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 1–20. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Baker, B., Book, R.: Reversal-bounded multipushdown machines. J. Comput. System Sci. 8, 315–332 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bouchy, F., Finkel, A., San Pietro, P.: Dense-choice counter machines revisited. In: Proc. of INFINITY 2009, pp. 3–22 (2009)

    Google Scholar 

  6. Bouchy, F., Finkel, A., Sangnier, A.: Reachability in timed counter systems. Electr. Notes Theor. Comput. Sci. 239, 167–178 (2009)

    Article  MathSciNet  Google Scholar 

  7. Cadilhac, M., Finkel, A., McKenzie, P.: Affine Parikh automata. RAIRO - Theor. Inf. and Applic. 46(4), 511–545 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cadilhac, M., Finkel, A., McKenzie, P.: Unambiguous constrained Automata. Int. J. Found. Comput. Sci. 24(7), 1099–1116 (2013)

    Article  MathSciNet  Google Scholar 

  9. Culik, K., Karhumaki, J.: The equivalence of finite valued transducers (on HDTOL languages) is decidable. Theoret. Comput. Sci. 47, 71–84 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dang, Z.: Binary reachability analysis of pushdown timed automata with dense clocks. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 506–517. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Dang, Z., Bultan, T., Ibarra, O.H., Kemmerer, R.A.: Past pushdown timed automata. In: Watson, B.W., Wood, D. (eds.) CIAA 2001. LNCS, vol. 2494, pp. 74–86. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Dang, Z., Ibarra, O.H., Bultan, T., Kemmerer, R.A., Su, J.: Binary reachability analysis of discrete pushdown timed automata. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 69–84. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Dang, Z., Ibarra, O.H., Miltersen, P.B.: Liveness verification of reversal-bounded multicounter machines with a free counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 132–143. Springer, Heidelberg (2001)

    Google Scholar 

  14. Dang, Z., Ibarra, O.H., Sun, Z.-W.: On two-way nondeterministic finite automata with one reversal-bounded counter. Theor. Comput. Sci. 330(1), 59–79 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Finkel, A., Sangnier, A.: Reversal-bounded counter machines revisited. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 323–334. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., Talbot, J.-M.: Properties of visibly pushdown transducers. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 355–367. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Ginsburg, S., Spanier, E.H.: Derivation-bounded languages. J. Comput. System Sci. 2(3), 228–250 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. T. Am. Math. Soc. 113, 333–368 (1964)

    MATH  MathSciNet  Google Scholar 

  19. Griffiths, T.: The unsolvability of the equivalence problem for Λ-free nondeterministic generalized sequential machines. J. Assoc. Comput. Mach. 15, 409–413 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  20. Gurari, E., Ibarra, O.H.: The complexity of decision problems for finite-turn multicounter machines. J. Comput. Syst. Sci. 22, 220–229 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  21. Gurari, E.: The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM J. Comput. 11, 448–452 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  22. Gurari, E., Ibarra, O.H.: Two-way counter machines and Diophantine equations. J. ACM 29(3), 863–873 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  23. Gurari, E., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Math. Systems Theory 16, 61–66 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  24. Hague, M., Lin, A.W.: Model checking recursive programs with numeric data types. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 743–759. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  25. Harju, T., Ibarra, O.H., Karhumaski, J., Salomaa, A.: Some decision problems concerning semilinearity and commutation. J. Comput. Syst. Sci. 65(2), 278–294 (2002)

    Article  MATH  Google Scholar 

  26. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata, Languages and Computation. Addison-Wesley (1978)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  28. Ibarra, O.H.: The unsolvability of the equivalence problem for ε-free NGSM’s with unary input (output) alphabet and applications. SIAM J. Computing 7, 524–532 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  29. Ibarra, O.H.: On the ambiguity, finite-valuedness, and lossiness problems in acceptors and transducers. In: Proc. of CIAA 2014 (to appear, 2014)

    Google Scholar 

  30. Ibarra, O.H.: On decidability and closure properties of language classes with respect to bio-operations. In: Proc. of DNA 20 (to appear)

    Google Scholar 

  31. Ibarra, O.H., Bultan, T., Su, J.: Reachability analysis for some models of infinite-state transition systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 183–198. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  32. Ibarra, O.H., Dang, Z.: On the solvability of a class of diophantine equations and applications. Theor. Comput. Sci. 352(1-3), 342–346 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  33. Ibarra, O.H., Dang, Z., Egecioglu, O., Saxena, G.: Characterizations of Catalytic Membrane Computing Systems. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 480–489. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  34. Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Computing (24), 123–137 (1995)

    Google Scholar 

  35. Ibarra, O.H., Seki, S.: Characterizations of bounded semilinear languages by one-way and two-way deterministic machines. In: Proc. 13th Int. Conf. on Automata and Formal Languages, pp. 211–224 (2011)

    Google Scholar 

  36. Ibarra, O.H., Seki, S.: Semilinear sets and counter machines: a brief survey (submitted)

    Google Scholar 

  37. Ibarra, O.H., Su, J., Dang, Z., Bultan, T., Kemmerer, R.A.: Counter machines: decidable properties and applications to verification problems. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 426–435. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  38. Ibarra, O.H., Yen, H.-C.: On the containment and equivalence problems for two-way transducers. Theor. Comput. Sci. 429, 155–163 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  39. Minsky, M.: Recursive unsolvability of Post’s problem of Tag and other topics in the theory of Turing machines. Ann. of Math. (74), 437–455 (1961)

    Google Scholar 

  40. Raskin, J.-F., Servais, F.: Visibly pushdown transducers. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 386–397. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  41. Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational horn clauses. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 337–352. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  42. Walljasper, S.J.: Left-derivation bounded languages. J. Comput. and System Sci. 8(1), 1–7 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  43. Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM. J. on Computing 22, 175–202 (1993)

    Article  MATH  Google Scholar 

  44. Wich, K.: Exponential ambiguity of context-free grammars. In: Proc. of 4th Int. Conf. on Developments in Language Theory, pp. 125–138. World Scientific (1999)

    Google Scholar 

  45. Xie, G., Dang, Z., Ibarra, O.H.: A Solvable class of quadratic diophantine equations with applications to verification of infinite-state systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 668–680. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  46. Xie, G., Dang, Z., Ibarra, O.H., Miltersen, P.B.: Dense counter machines and verification problems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 93–105. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Oscar H. Ibarra

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Helmut Jürgensen

  2. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. University of Turku, Fi-20014, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ibarra, O.H. (2014). Automata with Reversal-Bounded Counters: A Survey. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2014. Lecture Notes in Computer Science, vol 8614. Springer, Cham. https://doi.org/10.1007/978-3-319-09704-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09704-6_2

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09703-9

  • Online ISBN: 978-3-319-09704-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation