{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:52Z","timestamp":1760202472103,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,12,3]],"date-time":"1998-12-03T00:00:00Z","timestamp":912643200000},"content-version":"vor","delay-in-days":63,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0304-3975(98)00059-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"117-130","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Properties of probabilistic pushdown automata"],"prefix":"10.1016","volume":"207","author":[{"given":"Ioan I.","family":"Macarie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsunori","family":"Ogihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00059-0_BIB1","series-title":"Proc. 25th Symp. on Theory of Computing, ACM Press","first-page":"515","article-title":"Depth reduction for noncommutative arithmetic circuits","author":"Allender","year":"1993"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01744301","article-title":"On relativizing auxiliary pushdown machines","volume":"13","author":"Angluin","year":"1980","journal-title":"Math. Systems Theory"},{"issue":"1","key":"10.1016\/S0304-3975(98)00059-0_BIB3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"Chandra","year":"1981","journal-title":"Alternation. J. Assoc. for Comput. Mach."},{"key":"10.1016\/S0304-3975(98)00059-0_BIB4","article-title":"Formal properties of grammars","volume":"vol. 2","author":"Chomsky","year":"1963"},{"year":"1989","series-title":"Computational Models of Games","author":"Condon","key":"10.1016\/S0304-3975(98)00059-0_BIB5"},{"issue":"1","key":"10.1016\/S0304-3975(98)00059-0_BIB6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterizations of pushdown machines in terms of time-bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. for Comput. Mach."},{"key":"10.1016\/S0304-3975(98)00059-0_BIB7","series-title":"Information Processing, Information Processing Conference, North-Holland","first-page":"839","article-title":"Probabilistic machines can use less running time","author":"Freivalds","year":"1977"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB8","series-title":"Proc. 15th Symp. on Switching and Automata Theory","first-page":"170","article-title":"Two-way deterministic pushdown automata and some open problems in the theory of computation","author":"Galil","year":"1974"},{"issue":"4","key":"10.1016\/S0304-3975(98)00059-0_BIB9","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. on Comput."},{"key":"10.1016\/S0304-3975(98)00059-0_BIB10","series-title":"Randomness and Computation","first-page":"73","article-title":"Private coins versus public coins in interactive proof systems","author":"Goldwasser","year":"1989"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB11","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/BF00289513","article-title":"On non-determinacy in simple computing devices","volume":"1","author":"Hartmanis","year":"1972","journal-title":"Acta Informatica"},{"year":"1979","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","key":"10.1016\/S0304-3975(98)00059-0_BIB12"},{"issue":"1","key":"10.1016\/S0304-3975(98)00059-0_BIB13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1051\/ita\/1989230100871","article-title":"Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata","volume":"23","author":"Jenner","year":"1989","journal-title":"Theoret. Inform. and Appl. (RAIRO)"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(88)90122-3","article-title":"Alternating multihead finite automata","volume":"61","author":"King","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00059-0_BIB15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0213010","article-title":"Alternating pushdown and stack automata","volume":"13","author":"Ladner","year":"1984","journal-title":"SIAM J. on Comput."},{"key":"10.1016\/S0304-3975(98)00059-0_BIB16","series-title":"Proc. 12th Symp. on Theoretical Aspects of Computer Science, Springer","article-title":"On the structure of log-space probabilistic complexity classes","volume":"vol. 900","author":"Macarie","year":"1995"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02679455","article-title":"Multihead two-way probabilistic finite automata","volume":"30","author":"Macarie","year":"1997","journal-title":"Theory of Computing Systems"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB18_1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00263746","article-title":"Transformational methods and their application to complexity problems","volume":"6","author":"Monien","year":"1976","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB18_2","first-page":"383","volume":"8","author":"Monien","year":"1977","journal-title":"Corrigendum"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB19","series-title":"Proc. 24th Symp. on Foundations of Computer Science, IEEE Computer Society Press","first-page":"446","article-title":"Games against nature","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/S0304-3975(98)00059-0_BIB20","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","article-title":"Tree-size bounded alternation","volume":"21","author":"Ruzzo","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00059-0_BIB21","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0304-3975(98)00059-0_BIB22","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/322077.322083","article-title":"On the tape complexity of deterministic context-free languages","volume":"25","author":"Sudborough","year":"1978","journal-title":"J. Assoc. for Comput. Mach."},{"key":"10.1016\/S0304-3975(98)00059-0_BIB23","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0022-0000(91)90020-6","article-title":"Properties that characterize LOGCFL","volume":"43","author":"Venkateswaran","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00059-0_BIB24","series-title":"Proc. Conf. on Structure in Complexity Theory, IEEE Computer Society Press","first-page":"270","article-title":"Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits","author":"Vinay","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000590?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598000590?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:40Z","timestamp":1759625500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598000590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0304397598000590"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00059-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Properties of probabilistic pushdown automata","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00059-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}