{"id":"https://openalex.org/W4309466299","doi":"https://doi.org/10.1142/s012905412244004x","title":"Reversible Top-Down Syntax Analysis","display_name":"Reversible Top-Down Syntax Analysis","publication_year":2022,"publication_date":"2022-11-16","ids":{"openalex":"https://openalex.org/W4309466299","doi":"https://doi.org/10.1142/s012905412244004x"},"language":"en","primary_location":{"id":"doi:10.1142/s012905412244004x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905412244004x","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. 2, 35392 Giessen, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9564-2625","affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000744880","display_name":"Uwe Meyer","orcid":"https://orcid.org/0000-0003-0216-8803"},"institutions":[{"id":"https://openalex.org/I45155027","display_name":"Technische Hochschule Mittelhessen","ror":"https://ror.org/02qdc9985","country_code":"DE","type":"education","lineage":["https://openalex.org/I45155027"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Uwe Meyer","raw_affiliation_strings":["Technische Hochschule Mittelhessen, Wiesenstr. 14, 35390 Giessen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0216-8803","affiliations":[{"raw_affiliation_string":"Technische Hochschule Mittelhessen, Wiesenstr. 14, 35390 Giessen, Germany","institution_ids":["https://openalex.org/I45155027"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026803820"],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16838163,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"02n03","first_page":"225","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","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/T11567","display_name":"semigroups and automata theory","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/T10181","display_name":"Natural Language Processing Techniques","score":0.9837999939918518,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9783999919891357,"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.8931693434715271},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8222814202308655},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.742037296295166},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.6922973394393921},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.5591407418251038},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5077553987503052},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49671798944473267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4811031222343445},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4785105288028717},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.42012232542037964},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.39075982570648193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38681572675704956},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.38463741540908813},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3273956775665283},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.320708692073822},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27401202917099},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23146405816078186},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2230435311794281},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.1882888674736023},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.17229202389717102},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.1701982319355011},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13102033734321594}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.8931693434715271},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8222814202308655},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.742037296295166},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.6922973394393921},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.5591407418251038},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5077553987503052},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49671798944473267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4811031222343445},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4785105288028717},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.42012232542037964},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.39075982570648193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38681572675704956},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.38463741540908813},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3273956775665283},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.320708692073822},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27401202917099},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23146405816078186},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2230435311794281},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.1882888674736023},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.17229202389717102},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.1701982319355011},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13102033734321594},{"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/s012905412244004x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905412244004x","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W124851435","https://openalex.org/W155982404","https://openalex.org/W1981094023","https://openalex.org/W1998896169","https://openalex.org/W2003241571","https://openalex.org/W2011725207","https://openalex.org/W2022698632","https://openalex.org/W2023439061","https://openalex.org/W2048808408","https://openalex.org/W2069668725","https://openalex.org/W2075478599","https://openalex.org/W2092386826","https://openalex.org/W2096112873","https://openalex.org/W2105259569","https://openalex.org/W2130741488","https://openalex.org/W2150355702","https://openalex.org/W2796797028","https://openalex.org/W3004434164","https://openalex.org/W3189520617","https://openalex.org/W4233798822","https://openalex.org/W4301662502"],"related_works":["https://openalex.org/W2047588061","https://openalex.org/W1989148041","https://openalex.org/W4309466299","https://openalex.org/W3189520617","https://openalex.org/W3115605015","https://openalex.org/W1584306444","https://openalex.org/W1500295074","https://openalex.org/W1972388205","https://openalex.org/W2369671147","https://openalex.org/W2604798101"],"abstract_inverted_index":{"Top-down":[0],"syntax":[1],"analysis":[2],"can":[3,60,161],"be":[4,54,62,126,162],"based":[5],"on":[6,101,203],"[Formula:":[7,15,29,48,75,174,190,229],"see":[8,16,30,49,76,175,191,230],"text]":[9,17,50,231],"grammars.":[10],"The":[11,92],"canonical":[12],"acceptors":[13],"for":[14,87],"languages":[18,123],"are":[19,115,121,158,232,245,248],"deterministic":[20,166,182,221],"stateless":[21,167,183,222],"pushdown":[22,44,66,106,147,168,184,223],"automata":[23,107,148,169,224],"with":[24,46,68,108,145,170,186,225],"input":[25,70],"lookahead":[26,47,71,86,99,171,187,208,226],"of":[27,37,40,73,94,134,143,172,188,199,206,227],"size":[28,74,173,189,205,228],"text].":[31,77,192],"We":[32],"investigate":[33],"the":[34,102,141,204,207,215,243],"computational":[35],"capacity":[36],"reversible":[38,55,105,144,165,181,220],"computations":[39],"such":[41],"automata.":[42],"A":[43],"automaton":[45,67,185],"is":[51,79,209],"said":[52],"to":[53,117],"if":[56],"its":[57],"predecessor":[58],"configurations":[59],"uniquely":[61],"computed":[63],"by":[64,164,179,219],"a":[65,85,98],"backward":[69],"(lookback)":[72],"It":[78],"shown":[80],"that":[81,119,124,156,214,242],"we":[82,114,212,240],"cannot":[83,125],"trade":[84],"states":[88,96,109],"or":[89,97],"vice":[90],"versa.":[91],"impact":[93],"having":[95],"depends":[100],"language.":[103],"While":[104],"accept":[110],"all":[111],"regular":[112,122],"languages,":[113],"going":[116],"prove":[118,213],"there":[120,157],"accepted":[127,218],"reversibly":[128],"without":[129],"states,":[130],"even":[131],"in":[132,149],"case":[133],"an":[135,194],"arbitrarily":[136],"large":[137],"lookahead.":[138],"This":[139],"completes":[140],"comparison":[142],"ordinary":[146],"our":[150],"setting.":[151],"Moreover,":[152],"it":[153],"turns":[154],"out":[155],"problems":[159],"which":[160,247],"solved":[163],"text],":[176],"but":[177],"not":[178,233,249],"any":[180],"So,":[193],"infinite":[195],"and":[196],"tight":[197],"hierarchy":[198],"language":[200,216],"families":[201,217,244],"dependent":[202],"shown.":[210],"Finally,":[211],"closed":[234,250],"under":[235,251],"standard":[236],"operations.":[237],"For":[238],"example,":[239],"show":[241],"anti-AFLs":[246],"intersection.":[252]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}