Skip to main content
SpringerLink
Log in

Generalized Counters and Reversal Complexity

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2006)

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

  • 1042 Accesses

Abstract

We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

  • Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical state. Theoretical Computer Science 287(1), 299–311 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Dassow, J., Mitrana, V.: Finite Automata Over Free Generated Groups. Int. J. Algebra Comput. 10(6), 725–737 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Duris, P., Galil, Z.: Fooling a Two Way Automaton or one Pushdown Store is better than one Counter for two Way Machines. Theor. Comput. Sci. 21, 39–53 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7, 311–324 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  • Gurari, E.T., Ibarra, O.H.: Two-Way Counter Machines and Diophantine Equations. Journal of the ACM 29(3), 863–873 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • Ibarra, O.H., Jiang, T., Trn, N.Q., Wang, H.: On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages. Int. J. Found. Comput. Sci. 4(2), 135–146 (1993)

    Article  MATH  Google Scholar 

  • Ibarra, O.H., Sahni, S.K., Kim, C.E.: Finite Automata with multiplication. Theor. Comput. Sci. 2, 271–294 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  • Mitrana, V., Stiebe, R.: The Accepting Power of Finite Automata over Groups, New Trends in Formal Languages, (39-48) 1997; also TUCS Technical Report No. 70 (1996)

    Google Scholar 

  • Mitrana, V., Stiebe, R.: Extended finite automata over groups. Discrete Applied Mathematics 108(3), 287–300 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  • Miyano, S.: Two-way deterministic multi-weak-counter machines. Theor. Comput. Sci. 21(1), 27–37 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • Miyano, S.: Remarks on two-way automata with weak-counters. Inf. Process. Lett. 18(2), 105–107 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  • Monien, B.: Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. Inf. Process. Lett. 18(5), 239–242 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  • Petersen, H.: Two-way One-Counter Automata Accepting Bounded Languages. ACM SIGACT News archive 25(3), 102–105 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 560 012, India

    M. V. Panduranga Rao

Authors
  1. M. V. Panduranga Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Sciences Department, University of Wisconsin, 53706, Madison, WI, USA

    Jin-Yi Cai

  2. School of Mathematics, University of Leeds, LS2 9JT, Leeds, U.K.

    S. Barry Cooper

  3. State Key Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences,  

    Angsheng Li

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rao, M.V.P. (2006). Generalized Counters and Reversal Complexity. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_30

Download citation

  • DOI: https://doi.org/10.1007/11750321_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34021-8

  • Online ISBN: 978-3-540-34022-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation