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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buntrock, G., Otto, F.: Growing Context-Sensitive Languages and Church-Rosser Languages. Information and Computation 141(1), 1–36 (1998)
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)
Dahlhaus, E., Warmuth, M.K.: Membership for growing context-sensitive grammars is polynomial. Journal of Computer Systems Sciences 33(3), 456–472 (1986)
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
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)
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)
Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer, Heidelberg (1993)
Macarie, I.I., Ogihara, M.: Properties of Probabilistic Pushdown Automata. Theor. Comput. Sci. 207(1), 117–130 (1998)
McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. Journal of the Association Computing Machinery 35, 324–344 (1988)
Niemann, G.: Church-Rosser Languages and Related Classes, PhD Thesis, Univ. Kassel (2002)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)