{"id":"https://openalex.org/W2002663600","doi":"https://doi.org/10.1016/s0304-3975(98)00059-0","title":"Properties of probabilistic pushdown automata","display_name":"Properties of probabilistic pushdown automata","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2002663600","doi":"https://doi.org/10.1016/s0304-3975(98)00059-0","mag":"2002663600"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(98)00059-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00059-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/s0304-3975(98)00059-0","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087302620","display_name":"Ioan I. Macarie","orcid":null},"institutions":[{"id":"https://openalex.org/I4210147799","display_name":"Millennium Engineering and Integration (United States)","ror":"https://ror.org/05qmdfk04","country_code":"US","type":"company","lineage":["https://openalex.org/I4210147799"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ioan I. Macarie","raw_affiliation_strings":["Research and Advanced Development Group, Millennium Computer Corporation, 2851 Clover Street, Pittsford, NY 14534, USA","Millennium Computer Corp., Pittsford, NY#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research and Advanced Development Group, Millennium Computer Corporation, 2851 Clover Street, Pittsford, NY 14534, USA","institution_ids":["https://openalex.org/I4210147799"]},{"raw_affiliation_string":"Millennium Computer Corp., Pittsford, NY#TAB#","institution_ids":["https://openalex.org/I4210147799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019383096","display_name":"Mitsunori Ogihara","orcid":"https://orcid.org/0000-0002-5690-7854"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mitsunori Ogihara","raw_affiliation_strings":["Department of Computer Science, University of Rochester, Rochester, NY 14627, USA","University of Rochester; Rochester, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Rochester, Rochester, NY 14627, USA","institution_ids":["https://openalex.org/I5388228"]},{"raw_affiliation_string":"University of Rochester; Rochester, NY","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.5101,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.63789803,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"207","issue":"1","first_page":"117","last_page":"130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8013631105422974},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6848855018615723},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6615610122680664},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.6358190774917603},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6189693808555603},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5938181281089783},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5717313289642334},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5540701746940613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.501453161239624},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4492364227771759},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.43278127908706665},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.41000401973724365},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39704859256744385},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.36797285079956055},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.3464793264865875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3391106128692627},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32899749279022217},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3147052526473999},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.23464393615722656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2297985851764679},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.1105833649635315}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8013631105422974},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6848855018615723},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6615610122680664},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.6358190774917603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6189693808555603},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5938181281089783},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5717313289642334},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5540701746940613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.501453161239624},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4492364227771759},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.43278127908706665},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.41000401973724365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39704859256744385},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.36797285079956055},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.3464793264865875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3391106128692627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32899749279022217},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3147052526473999},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.23464393615722656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2297985851764679},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.1105833649635315},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(98)00059-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00059-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s0304-3975(98)00059-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0304-3975(98)00059-0","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W47137029","https://openalex.org/W344542471","https://openalex.org/W639289183","https://openalex.org/W1528588003","https://openalex.org/W1605773274","https://openalex.org/W1965022641","https://openalex.org/W1971842919","https://openalex.org/W1979328074","https://openalex.org/W1985677568","https://openalex.org/W1989382950","https://openalex.org/W2002089154","https://openalex.org/W2006253309","https://openalex.org/W2007710676","https://openalex.org/W2032312352","https://openalex.org/W2039391944","https://openalex.org/W2051700974","https://openalex.org/W2059442002","https://openalex.org/W2061631274","https://openalex.org/W2077476995","https://openalex.org/W2079275582","https://openalex.org/W2123466414","https://openalex.org/W2288513360","https://openalex.org/W2741390383","https://openalex.org/W3149462197","https://openalex.org/W4241108585","https://openalex.org/W4302339081","https://openalex.org/W6601876578","https://openalex.org/W6646293328","https://openalex.org/W6655227154","https://openalex.org/W6658438025","https://openalex.org/W6672251445","https://openalex.org/W6678317355"],"related_works":["https://openalex.org/W392685101","https://openalex.org/W1972232894","https://openalex.org/W1991406344","https://openalex.org/W2067895928","https://openalex.org/W2171067235","https://openalex.org/W2012479020","https://openalex.org/W2472752294","https://openalex.org/W127918926","https://openalex.org/W1486486721","https://openalex.org/W4241567000"],"abstract_inverted_index":{"Properties":[0],"of":[1,34,43,72,90,96,117],"(unbounded-error)":[2],"probabilistic":[3,55],"as":[4,6,99,111],"well":[5],"\u201cprobabilistic":[7,59],"plus":[8,60],"nondeterministic\u201d":[9,61],"pushdown":[10,14,52],"automata":[11,15,53,77],"and":[12,27,57,101,104,107],"auxiliary":[13,51],"are":[16,20,38,67],"studied.":[17],"These":[18],"models":[19],"analogous":[21],"to":[22],"their":[23],"counterparts":[24],"with":[25,54,58,78],"nondeterministic":[26],"alternating":[28],"states.":[29,62],"Complete":[30],"characterizations":[31],"in":[32],"terms":[33],"well-known":[35],"complexity":[36,64],"classes":[37,42,71,95],"given":[39,68],"for":[40,69],"the":[41,70,92,112,115,123],"languages":[44,73,97],"recognized":[45,74],"by":[46,75,85],"polynomial":[47],"time-bounded,":[48],"logarithmic":[49],"space-bounded":[50],"states":[56],"Also,":[63],"lower":[65],"bounds":[66],"these":[76],"unlimited":[79],"running":[80],"time.":[81],"It":[82],"follows":[83],"that,":[84],"fixing":[86],"an":[87],"appropriate":[88],"mode":[89],"computation,":[91],"difference":[93,113],"between":[94,114],"such":[98],"P":[100],"PSPACE,":[102],"NL":[103],"SAC1,":[105],"PL":[106],"Diff>(#SAC1)":[108],"is":[109],"characterized":[110],"number":[116],"stack":[118,124],"symbols;":[119],"that":[120],"is,":[121],"whether":[122],"alphabet":[125],"contains":[126],"one":[127],"versus":[128],"two":[129],"distinct":[130],"symbols.":[131]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}