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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages343-352
Number of pages10
Volume965
ISBN (Print)3540602496, 9783540602491
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Probabilistic Automata
Pushdown Automata
Polynomials
Complexity Classes
Automata
Polynomial time
Logarithmic
Lower bound
Distinct
Class
Language

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Macarie, I. I., & Ogihara, M. (1995). Properties of probabilistic pushdown automata: (Extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 965, pp. 343-352). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 965). Springer Verlag.

Properties of probabilistic pushdown automata : (Extended abstract). / Macarie, Ioan I.; Ogihara, Mitsunori.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 965 Springer Verlag, 1995. p. 343-352 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 965).

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

Macarie, II & Ogihara, M 1995, Properties of probabilistic pushdown automata: (Extended abstract). in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 965, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 965, Springer Verlag, pp. 343-352, 10th Conference on Fundamentals of Computation Theory, FCT 1995, Dresden, Germany, 8/22/95.
Macarie II, Ogihara M. Properties of probabilistic pushdown automata: (Extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 965. Springer Verlag. 1995. p. 343-352. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Macarie, Ioan I. ; Ogihara, Mitsunori. / Properties of probabilistic pushdown automata : (Extended abstract). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 965 Springer Verlag, 1995. pp. 343-352 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2ecded5b1f2340e49c19f70ab3cd1cb9,
title = "Properties of probabilistic pushdown automata: (Extended abstract)",
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.",
author = "Macarie, {Ioan I.} and Mitsunori Ogihara",
year = "1995",
language = "English (US)",
isbn = "3540602496",
volume = "965",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "343--352",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Properties of probabilistic pushdown automata

T2 - (Extended abstract)

AU - Macarie, Ioan I.

AU - Ogihara, Mitsunori

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947912337&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947912337&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540602496

SN - 9783540602491

VL - 965

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 343

EP - 352

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -