{"id":"https://openalex.org/W2284766497","doi":"https://doi.org/10.1142/s0129054115400122","title":"Simplification Problems for Deterministic Pushdown Automata on Infinite Words","display_name":"Simplification Problems for Deterministic Pushdown Automata on Infinite Words","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2284766497","doi":"https://doi.org/10.1142/s0129054115400122","mag":"2284766497"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054115400122","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054115400122","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5021229064","display_name":"Christof L\u00f6ding","orcid":"https://orcid.org/0000-0002-1529-2806"},"institutions":[{"id":"https://openalex.org/I4210126395","display_name":"Inform (Germany)","ror":"https://ror.org/02x8c2t37","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210126395"]},{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christof L\u00f6ding","raw_affiliation_strings":["Lehrstuhl Informatik 7, RWTH Aachen University, 52056 Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl Informatik 7, RWTH Aachen University, 52056 Aachen, Germany","institution_ids":["https://openalex.org/I4210126395","https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021229064"],"corresponding_institution_ids":["https://openalex.org/I4210126395","https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12867294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"26","issue":"08","first_page":"1041","last_page":"1068"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9437721371650696},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8548675775527954},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6566567420959473},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.5857017636299133},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5773166418075562},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.560875415802002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5521411895751953},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5150518417358398},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.45698195695877075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3005354702472687},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2625812292098999},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.21167626976966858},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1891646385192871}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.9437721371650696},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8548675775527954},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6566567420959473},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.5857017636299133},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5773166418075562},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.560875415802002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5521411895751953},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5150518417358398},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.45698195695877075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3005354702472687},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2625812292098999},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.21167626976966858},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1891646385192871}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054115400122","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054115400122","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:publications.rwth-aachen.de:674596","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/674596","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International journal of foundations of computer science : IJFCS 26(8), 1041-1068 (2015). doi:10.1142/S0129054115400122","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.41999998688697815,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1725438563","https://openalex.org/W1989863177","https://openalex.org/W2038722538","https://openalex.org/W2043998485","https://openalex.org/W2046366128","https://openalex.org/W2064465758","https://openalex.org/W2079601390","https://openalex.org/W2088846354","https://openalex.org/W2111753126","https://openalex.org/W2603583615","https://openalex.org/W3022006420"],"related_works":["https://openalex.org/W1537446812","https://openalex.org/W1541953080","https://openalex.org/W2026528778","https://openalex.org/W2002023748","https://openalex.org/W2069535086","https://openalex.org/W2950941115","https://openalex.org/W2008234710","https://openalex.org/W2051999169","https://openalex.org/W2047588061","https://openalex.org/W1804899877"],"abstract_inverted_index":{"The":[0,41,104],"article":[1],"surveys":[2],"some":[3,17,45,59,131,140],"decidability":[4,132],"results":[5,19,42,61,133],"concerning":[6],"simplification":[7,106],"problems":[8],"for":[9,26,51,67,139],"DPDAs":[10],"on":[11,20,47,62,134],"infinite":[12],"words":[13],"(\u03c9-DPDAs).":[14],"We":[15,129],"summarize":[16],"recent":[18],"the":[21,48,63,70,76,79,92,113,123],"regularity":[22],"problem,":[23],"which":[24],"asks":[25,108],"a":[27,38,52,73,87,100,126],"given":[28,127],"\u03c9-DPDA,":[29],"whether":[30,109],"its":[31],"language":[32,124],"can":[33,111],"also":[34,43],"be":[35],"accepted":[36],"by":[37],"finite":[39],"automaton.":[40],"give":[44],"insights":[46],"equivalence":[49],"problem":[50,66],"subclass":[53],"of":[54,72,78,116,125,136,142],"\u03c9-DPDA.":[55,128],"Furthermore,":[56],"we":[57],"present":[58],"new":[60],"parity":[64,74],"index":[65],"\u03c9-DPDAs.":[68,143],"For":[69],"specification":[71],"condition,":[75],"states":[77],"\u03c9-DPDA":[80],"are":[81,119],"assigned":[82],"priorities":[83,117],"(natural":[84],"numbers),":[85],"and":[86],"run":[88,101],"is":[89,102],"accepting":[90],"if":[91],"highest":[93],"priority":[94],"that":[95,118],"appears":[96],"infinitely":[97],"often":[98],"during":[99],"even.":[103],"basic":[105],"question":[107,138],"one":[110],"determine":[112],"minimal":[114],"number":[115],"needed":[120],"to":[121],"accept":[122],"provide":[130],"variations":[135],"this":[137],"classes":[141]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}