Skip to main content
SpringerLink
Log in

Probabilistic Length-Reducing Automata

  • Conference paper
Book cover Mathematical Foundations of Computer Science 2006 (MFCS 2006)

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

Abstract

Hardness of a separation of nondeterminism, randomization and determinism for polynomial time computations motivates the analysis of restricted models of computation. Following this line of research, we consider randomized length-reducing two-pushdown automata (lrTPDA), a natural extension of pushdown automata (PDA). We separate randomized lrTPDAs from deterministic and nondeterministic ones, and we compare different modes of randomization. Moreover, we prove that amplification is impossible for Las Vegas automata.

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

  1. Buntrock, G., Otto, F.: Growing Context-Sensitive Languages and Church-Rosser Languages. Information and Computation 141(1), 1–36 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hromkovic, J., Schnitger, G.: Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 66–80. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Dahlhaus, E., Warmuth, M.K.: Membership for growing context-sensitive grammars is polynomial. Journal of Computer Systems Sciences 33(3), 456–472 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  4. Jurdziński, T., Loryś, K.: Church-Rosser Languages vs. UCFL. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 147–158. Springer, Heidelberg (2002), www.ii.uni.wroc.pl/~tju/FullCRL.pdf

    Chapter  Google Scholar 

  5. Jurdziński, T.: The boolean closure of growing context-sensitive languages. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 248–259. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Kaneps, J., Geidmanis, D., Freivalds, R.: Tally Languages Accepted by Monte Carlo Pushdown Automata. In: Rolim, J.D.P. (ed.) RANDOM 1997. LNCS, vol. 1269, pp. 187–195. Springer, Heidelberg (1997)

    Google Scholar 

  7. Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  8. Macarie, I.I., Ogihara, M.: Properties of Probabilistic Pushdown Automata. Theor. Comput. Sci. 207(1), 117–130 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  9. McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. Journal of the Association Computing Machinery 35, 324–344 (1988)

    MATH  MathSciNet  Google Scholar 

  10. Niemann, G.: Church-Rosser Languages and Related Classes, PhD Thesis, Univ. Kassel (2002)

    Google Scholar 

  11. Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inf. Comp. 197(1-2), 1–21 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Wrocław University, Przesmyckiego 20, PL-51-151, Wrocław, Poland

    Tomasz Jurdziński

Authors
  1. Tomasz Jurdziński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Comenius University, Mlynská dolina, 84248, Bratislava, Slovakia

    Rastislav Královič

  2. Institute of Informatics, University of Warsaw, Poland

    Paweł Urzyczyn

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jurdziński, T. (2006). Probabilistic Length-Reducing Automata. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_49

Download citation

  • DOI: https://doi.org/10.1007/11821069_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37791-7

  • Online ISBN: 978-3-540-37793-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation