Abstract
Properties of probabilistic as well as “probabilistic plus nondeterministic” pushdown automata and auxiliary pushdown automata are studied. These models are analogous to their counterparts with nondeterministic and alternating states. Complete characterizations in terms of well-known complexity classes are given for the classes of languages recognized by polynomial time-bounded, logarithmic space-bounded auxiliary pushdown automata with probabilistic states and with “probabilistic plus nondeterministic” states. Also, complexity lower bounds are given for the classes of languages recognized by these automata with unlimited running time. It follows that, by fixing an appropriate mode of computation, the difference between classes of languages such as P and PSPACE, NL and SAC1, PL and Diff>(#SAC1) is characterized as the difference between the number of stack symbols; that is, whether the stack alphabet contains one versus two distinct symbols.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Allender and J. Jiao. Depth reduction for noncommutative arithmetic circuit. In Proceedings of the 25th Symposium on Theory of Computing, pages 515–522. ACM Press, 1993.
D. Angluin. On Relativising Auxiliary Pushdown Machines. Mathematical Systems Theory, 13(4):283–299, 1980.
A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114–133, January 1981.
A. Condon. Computational models of games. M.I.T. Press, 1989.
S. Cook. Characterizations of pushdown machines in terms of time-bounded computers. Journal of the Association for Computing Machinery, 18(1):4–18, January 1971.
R. Freivalds. Probabilistic two-way machines. In Proceedings of the 6th Symposium on Mathematical Foundations of Computer Science, pages 33–45. Springer-Verlag Lecture Notes in Computer Science #118, 1981.
Z. Galil. Two-way deterministic pushdown automata and some open problems in the theory of computation. In Proceedings of the 15th Symposium on Switching and Automata Theory, pages 170–177, 1974.
J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6(4):675–695, 1977.
S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In S. Micali, editor, Randomness and Computation, pages 73–90. Advances in Computing Research # 5, JAI Press Inc., Greenwich, CT, 1989.
J. Hartmanis. On non-determinancy in simple computing devices. Acta Informatica, 1:336–344, 1972.
J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA, 1979.
J. Kaneps. Stochasticity of the languages recognized by 2-way finite probabilistic automata. Diskretnaya Mtematika, 1(4):63–77, 1989. (Russian).
K. King. Alternating multihead finite automata. Theoretical Computer Science, 61:149–174, 1988.
R. Ladner, L. Stockmeyer, and R. Lipton. Alternating pushdown and stack automata. SIAM Journal on Computing, 13(1):135–155, February 1984.
I.I. Macarie. On the structure of log-space probabilistic complexity classes. In Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, pages 583–596. Springer-Verlag Lecture Notes in Computer Science #900, 1995.
B. Monien. Transformational methods and their application to complexity problems. Acta Informatica, 6:95–108, 1976. Corrigendum, 8:383–384, 1977.
C. Papadimitriou. Games against nature. In Proceedings of the 24th Symposium on Foundations of Computer Science, pages 446–450. IEEE Computer Society Press, 1983.
W. Ruzzo. Tree-size bounded alternation. Journal of Computer and System Science, 21:218–235, 1980.
I. Sudborough. On tape-bounded complexity classes and multihead finite automata. Journal of Computer and System Science, 10:62–76, 1975.
I. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25(3):405–414, July 1978.
H. Venkateswaran. Properties that characterize LOGCFL. Journal of Computer and System Science, 43:380–404, 1991.
V. Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proceedings of the 6th Conference on Structure in Complexity Theory, pages 270–284. IEEE Computer Society Press, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Macarie, I.I., Ogihara, M. (1995). Properties of probabilistic pushdown automata. In: Reichel, H. (eds) Fundamentals of Computation Theory. FCT 1995. Lecture Notes in Computer Science, vol 965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60249-6_66
Download citation
DOI: https://doi.org/10.1007/3-540-60249-6_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60249-1
Online ISBN: 978-3-540-44770-2
eBook Packages: Springer Book Archive