Properties of probabilistic pushdown automata: (Extended abstract)

Ioan I. Macarie, Mitsunori Ogihara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - 10th International Conference, FCT 1995, Proceedings
EditorsHorst Reichel
PublisherSpringer Verlag
Pages343-352
Number of pages10
ISBN (Print)3540602496, 9783540602491
DOIs
StatePublished - Jan 1 1995
Externally publishedYes
Event10th Conference on Fundamentals of Computation Theory, FCT 1995 - Dresden, Germany
Duration: Aug 22 1995Aug 25 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume965
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th Conference on Fundamentals of Computation Theory, FCT 1995
CountryGermany
CityDresden
Period8/22/958/25/95

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Properties of probabilistic pushdown automata: (Extended abstract)'. Together they form a unique fingerprint.

  • Cite this

    Macarie, I. I., & Ogihara, M. (1995). Properties of probabilistic pushdown automata: (Extended abstract). In H. Reichel (Ed.), Fundamentals of Computation Theory - 10th International Conference, FCT 1995, Proceedings (pp. 343-352). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 965). Springer Verlag. https://doi.org/10.1007/3-540-60249-6_66