{"id":"https://openalex.org/W2026528778","doi":"https://doi.org/10.1137/0207032","title":"Polynomial Algorithms for Deterministic Pushdown Automata","display_name":"Polynomial Algorithms for Deterministic Pushdown Automata","publication_year":1978,"publication_date":"1978-11-01","ids":{"openalex":"https://openalex.org/W2026528778","doi":"https://doi.org/10.1137/0207032","mag":"2026528778"},"language":"en","primary_location":{"id":"doi:10.1137/0207032","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207032","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniel J. Rosenkrantz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086835651","display_name":"Harry B. Hunt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harry B. Hunt III","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009388396"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5307,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62128287,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"4","first_page":"405","last_page":"412"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"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":1.0,"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/T12029","display_name":"DNA and Biological Computing","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9987999796867371,"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/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.9792238473892212},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8769426345825195},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.7132607698440552},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6173722743988037},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6101697087287903},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5998212099075317},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.588286817073822},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5547124147415161},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5358307361602783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5213780999183655},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4985530376434326},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4839465916156769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4647981524467468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4224036633968353},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4108814001083374},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2596704959869385},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.23979970812797546},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.17430579662322998},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.14559516310691833},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08038470149040222},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.06221398711204529}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.9792238473892212},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8769426345825195},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.7132607698440552},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6173722743988037},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6101697087287903},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5998212099075317},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.588286817073822},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5547124147415161},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5358307361602783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5213780999183655},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4985530376434326},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4839465916156769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4647981524467468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4224036633968353},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4108814001083374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2596704959869385},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.23979970812797546},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.17430579662322998},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.14559516310691833},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08038470149040222},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.06221398711204529},{"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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0207032","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207032","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1982206794","https://openalex.org/W1982581840","https://openalex.org/W1990893893","https://openalex.org/W2009215937","https://openalex.org/W2010866826","https://openalex.org/W2020570874","https://openalex.org/W2040857571","https://openalex.org/W2066256384","https://openalex.org/W2070015363","https://openalex.org/W2079601390","https://openalex.org/W2592184324"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2074593591","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W2023439061","https://openalex.org/W2047588061","https://openalex.org/W2950941115","https://openalex.org/W1584306444","https://openalex.org/W2026528778","https://openalex.org/W1990051509"],"abstract_inverted_index":{"An":[0],"algorithm":[1,29],"is":[2,24],"presented":[3],"for":[4,64,69],"converting":[5],"a":[6,35,54],"deterministic":[7],"pushdown":[8,71],"automaton":[9],"(dpda)":[10],"of":[11,25,44],"size":[12,26],"n":[13],"into":[14],"an":[15],"equivalent":[16],"dpda":[17,22,65],"that":[18],"always":[19],"halts.":[20],"The":[21,28],"produced":[23],"$O(n)$.":[27],"operates":[30],"in":[31,49],"linear":[32],"time":[33,50,62],"on":[34,53,60],"random":[36],"access":[37],"machine":[38],"(but":[39],"may":[40],"require":[41],"the":[42],"allocation":[43],"$O(n^2":[45,51],")$":[46,52],"storage),":[47],"and":[48,68],"multi-tape":[55],"Turing":[56],"machine.":[57],"Related":[58],"results":[59],"polynomial":[61],"algorithms":[63],"equivalence":[66],"problems":[67,75],"two-way":[70],"automata":[72],"language":[73],"recognition":[74],"are":[76],"discussed.":[77]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}