{"id":"https://openalex.org/W4411219013","doi":"https://doi.org/10.1142/s0129054125410072","title":"Sweeping Input-Driven Pushdown Automata","display_name":"Sweeping Input-Driven Pushdown Automata","publication_year":2025,"publication_date":"2025-06-11","ids":{"openalex":"https://openalex.org/W4411219013","doi":"https://doi.org/10.1142/s0129054125410072"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054125410072","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125410072","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/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625"},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Kutrib","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392 Giessen, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9564-2625","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026803820"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.7114,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.70695649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"37","issue":"01","first_page":"167","last_page":"191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9965000152587891,"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/T11567","display_name":"semigroups and automata theory","score":0.996399998664856,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8051596879959106},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.8050512075424194},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7210296392440796},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.7175599336624146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6111757159233093},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5506286025047302},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.43135422468185425},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.39774811267852783},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3752947449684143},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3320425748825073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3314554691314697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31237390637397766},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.24394255876541138},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.15731367468833923},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.14277485013008118},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13267552852630615},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.11716043949127197},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.11204695701599121},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.08595487475395203}],"concepts":[{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8051596879959106},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8050512075424194},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7210296392440796},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.7175599336624146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6111757159233093},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5506286025047302},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.43135422468185425},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.39774811267852783},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3752947449684143},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3320425748825073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3314554691314697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31237390637397766},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.24394255876541138},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.15731367468833923},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.14277485013008118},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13267552852630615},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.11716043949127197},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.11204695701599121},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.08595487475395203},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054125410072","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125410072","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W31912597","https://openalex.org/W58916880","https://openalex.org/W1486486721","https://openalex.org/W1502281730","https://openalex.org/W1970379778","https://openalex.org/W1979328074","https://openalex.org/W1984896712","https://openalex.org/W1990098488","https://openalex.org/W2009215937","https://openalex.org/W2013651986","https://openalex.org/W2017143384","https://openalex.org/W2019570031","https://openalex.org/W2023445075","https://openalex.org/W2023552752","https://openalex.org/W2031307533","https://openalex.org/W2032623970","https://openalex.org/W2032759707","https://openalex.org/W2040136857","https://openalex.org/W2057191841","https://openalex.org/W2076889648","https://openalex.org/W2091988401","https://openalex.org/W2107398710","https://openalex.org/W2131886132","https://openalex.org/W2142746286","https://openalex.org/W2151033407","https://openalex.org/W2394532974","https://openalex.org/W2417968307","https://openalex.org/W2512356998","https://openalex.org/W2519069132","https://openalex.org/W2533977282","https://openalex.org/W3112829113","https://openalex.org/W3126043357","https://openalex.org/W4214848047","https://openalex.org/W4225996887","https://openalex.org/W4285174748","https://openalex.org/W4385710996"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W127918926","https://openalex.org/W1486486721","https://openalex.org/W2089141720","https://openalex.org/W214992615","https://openalex.org/W2049492436","https://openalex.org/W4206600150","https://openalex.org/W2400175085","https://openalex.org/W2116448069"],"abstract_inverted_index":{"Input-driven":[0],"pushdown":[1,7,15,33,49,149],"automata":[2,8,34],"([Formula:":[3],"see":[4,74,79,103,115,127],"text])":[5],"are":[6,137,165],"where":[9],"the":[10,14,24,37,58,64,99,110,124],"next":[11],"action":[12],"on":[13,83],"store":[16],"(push,":[17],"pop,":[18],"nothing)":[19],"is":[20,51,117],"solely":[21],"governed":[22],"by":[23,167],"current":[25],"input":[26,38,59,85],"symbol.":[27],"Here,":[28],"we":[29,67,97,122,136,152],"introduce":[30],"sweeping":[31,47],"input-driven":[32,48],"that":[35,55,81,141,159],"process":[36],"in":[39,139],"multiple":[40],"passes":[41],"(also":[42],"sweeps).":[43],"That":[44],"is,":[45],"a":[46,52],"automaton":[50],"two-way":[53],"device":[54],"may":[56],"change":[57],"head":[60],"direction":[61],"only":[62],"at":[63],"endmarkers.":[65],"First":[66],"show":[68,158],"that,":[69],"given":[70],"an":[71,76],"arbitrary":[72],"[Formula:":[73,78,102,114,126],"text],":[75],"equivalent":[77],"text]":[80,128],"halts":[82],"any":[84],"can":[86],"effectively":[87],"be":[88],"constructed.":[89],"From":[90],"this":[91,120],"result":[92],"further":[93],"properties":[94],"follow.":[95],"Then":[96],"address":[98],"determinization":[100],"of":[101,113,148,169,172],"text]s":[104,116],"and":[105,157,161],"its":[106],"descriptional":[107],"complexity.":[108],"Furthermore,":[109],"computational":[111],"capacity":[112],"studied.":[118],"To":[119],"end,":[121],"compare":[123],"family":[125],"with":[129],"other":[130,163],"well-known":[131],"language":[132],"families.":[133],"In":[134],"particular,":[135],"interested":[138],"families":[140],"have":[142],"strong":[143],"relations":[144],"to":[145],"some":[146],"kind":[147],"machines.":[150,180],"Finally,":[151],"explore":[153],"several":[154,162],"decidability":[155],"problems":[156,164,171],"emptiness":[160],"non-semidecidable":[166,170],"reductions":[168],"deterministic,":[173],"linearly":[174],"space":[175],"bounded,":[176],"one-tape,":[177],"one-head":[178],"Turing":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-02-14T06:23:00.392402","created_date":"2025-10-10T00:00:00"}