{"id":"https://openalex.org/W7131264015","doi":"https://doi.org/10.1007/s00236-026-00522-5","title":"Deterministic tree-walking-storage automata","display_name":"Deterministic tree-walking-storage automata","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131264015","doi":"https://doi.org/10.1007/s00236-026-00522-5"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-026-00522-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-026-00522-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-026-00522-5.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00236-026-00522-5.pdf","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":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr.\u00a02, 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.\u00a014, 35390, Giessen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Hochschule Mittelhessen, Wiesenstr.\u00a014, 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":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3917898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"63","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.4512999951839447,"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.4512999951839447,"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.37860000133514404,"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/T10142","display_name":"Formal Methods in Verification","score":0.0723000019788742,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6330000162124634},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6068999767303467},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5576000213623047},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5378000140190125},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5020999908447266},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.4553000032901764},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.44119998812675476},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4207000136375427},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.37450000643730164}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6330000162124634},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6068999767303467},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6008999943733215},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5576000213623047},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5404000282287598},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5378000140190125},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5020999908447266},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.4553000032901764},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.44119998812675476},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4207000136375427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3982999920845032},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.37450000643730164},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.3662000000476837},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3659000098705292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36399999260902405},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35350000858306885},{"id":"https://openalex.org/C119024030","wikidata":"https://www.wikidata.org/wiki/Q759899","display_name":"Call stack","level":3,"score":0.35010001063346863},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.314300000667572},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29809999465942383},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.2939999997615814},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.2874000072479248},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.26919999718666077},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2597000002861023}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00236-026-00522-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-026-00522-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-026-00522-5.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00236-026-00522-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-026-00522-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-026-00522-5.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7131264015.pdf","grobid_xml":"https://content.openalex.org/works/W7131264015.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1069688093","https://openalex.org/W1498193456","https://openalex.org/W1890888469","https://openalex.org/W1965061701","https://openalex.org/W1981137954","https://openalex.org/W1982449618","https://openalex.org/W1987709131","https://openalex.org/W1990345806","https://openalex.org/W2004701601","https://openalex.org/W2010873193","https://openalex.org/W2016758987","https://openalex.org/W2021158845","https://openalex.org/W2029610959","https://openalex.org/W2030011197","https://openalex.org/W2040136857","https://openalex.org/W2040655280","https://openalex.org/W2042527825","https://openalex.org/W2046505442","https://openalex.org/W2052674111","https://openalex.org/W2072964679","https://openalex.org/W2074472454","https://openalex.org/W2169203237","https://openalex.org/W2229846802","https://openalex.org/W2409739580","https://openalex.org/W2618109676","https://openalex.org/W2754370965","https://openalex.org/W3158013313","https://openalex.org/W3199131588","https://openalex.org/W4229560414","https://openalex.org/W4248605269","https://openalex.org/W4292142061","https://openalex.org/W4377081428"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"introduce":[2],"and":[3,80,96,161],"investigate":[4,104],"tree-walking-storage":[5,35,69,128],"automata,":[6,21,91,136],"which":[7],"are":[8,18,153],"finite-state":[9],"devices":[10],"equipped":[11],"with":[12,133],"a":[13,30,68,77,100,118,141],"tree-like":[14,32],"storage.":[15],"The":[16],"automata":[17,36,129],"generalized":[19],"stack":[20,25,90,135],"where":[22,52],"the":[23,38,42,45,50,53,57,85,109,124,148],"linear":[24],"storage":[26,47],"is":[27],"replaced":[28],"by":[29],"non-linear":[31],"stack.":[33],"Therefore,":[34],"have":[37],"ability":[39],"to":[40,61,76,103,139],"explore":[41],"interior":[43],"of":[44,56,63,112,127,147,151],"tree":[46,58,78],"without":[48],"altering":[49],"contents,":[51],"possible":[54],"moves":[55],"pointer":[59],"correspond":[60],"those":[62],"tree-walking":[64],"automata.":[65],"In":[66,116,155],"addition,":[67],"automaton":[70],"can":[71],"append":[72],"(push)":[73],"non-existent":[74],"descendants":[75],"node":[79],"remove":[81],"(pop)":[82],"leaves":[83],"from":[84],"tree.":[86],"As":[87,99],"for":[88],"classical":[89,134],"we":[92,107,157],"also":[93],"consider":[94,108,158],"non-erasing":[95],"checking":[97],"variants.":[98,115],"first":[101],"step":[102],"these":[105],"models":[106],"computational":[110],"capacities":[111],"deterministic":[113],"one-way":[114],"particular,":[117,156],"primary":[119],"focus":[120],"lies":[121],"on":[122],"comparing":[123],"different":[125],"variants":[126],"as":[130,132],"well":[131],"enabling":[137],"us":[138],"draw":[140],"complete":[142],"picture.":[143],"Basic":[144],"closure":[145],"properties":[146],"induced":[149],"families":[150],"languages":[152],"shown.":[154],"Boolean":[159],"operations":[160],"several":[162],"AFL":[163],"operations.":[164]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-02-25T00:00:00"}