{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:28:32Z","timestamp":1777868912535,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T00:00:00Z","timestamp":1772150400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006114","name":"S\u00e4chsisches Staatsministerium f\u00fcr Wissenschaft und Kunst","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006114","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115840","type":"journal-article","created":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:47:48Z","timestamp":1772207268000},"page":"115840","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Global one-counter tree automata"],"prefix":"10.1016","volume":"1071","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9532-0994","authenticated-orcid":false,"given":"Luisa","family":"Herrmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3350-0465","authenticated-orcid":false,"given":"Richard","family":"M\u00f6rbitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115840_bib0001","series-title":"CAAP \u201981","first-page":"211","article-title":"On pushdown tree automata","volume":"112","author":"Guessarian","year":"1981"},{"key":"10.1016\/j.tcs.2026.115840_bib0002","series-title":"Automata, Languages and Programming","first-page":"681","article-title":"Monadic second-order logics with cardinalities","volume":"2719","author":"Klaedtke","year":"2003"},{"key":"10.1016\/j.tcs.2026.115840_bib0003","series-title":"Automata-Based Decision Procedures for Weak Arithmetics","author":"Klaedtke","year":"2004"},{"key":"10.1016\/j.tcs.2026.115840_bib0004","series-title":"Technical Report 86-11","article-title":"Context-Free Grammars with Storage","author":"Engelfriet","year":"1986"},{"key":"10.1016\/j.tcs.2026.115840_bib0005","series-title":"Global Index Languages","author":"Castano","year":"2004"},{"key":"10.1016\/j.tcs.2026.115840_bib0006","series-title":"Foundations of Software Science and Computation Structures","first-page":"240","article-title":"Unboundedness problems for machines with reversal-bounded counters","volume":"13992","author":"Baumann","year":"2023"},{"key":"10.1016\/j.tcs.2026.115840_bib0007","series-title":"Implementation and Application of Automata","first-page":"166","article-title":"Global one-counter tree automata","author":"Herrmann","year":"2024"},{"key":"10.1016\/j.tcs.2026.115840_bib0008","unstructured":"A. Amarilli, M. Jeanmougin, A proof of the pumping lemma for context-free languages through pushdown automata, 2013, arXiv: 1207.2819."},{"issue":"1","key":"10.1016\/j.tcs.2026.115840_bib0009","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1051\/ita\/1992260100931","article-title":"Indexed counter languages","volume":"26","author":"Duske","year":"1992","journal-title":"RAIRO - Theor. Inf. Appl."},{"key":"10.1016\/j.tcs.2026.115840_bib0010","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. L\u00f6ding, S. Tison, M. Tommasi, Tree automata techniques and applications, 2008. https:\/\/inria.hal.science\/hal-03367725."},{"key":"10.1016\/j.tcs.2026.115840_bib0011","series-title":"Technical Report 177","article-title":"Parikh Automata and Monadic Second-Order Logics with Linear Cardinality Constraints","author":"Klaedtke","year":"2002"},{"key":"10.1016\/j.tcs.2026.115840_bib0012","series-title":"14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)","first-page":"100","article-title":"Non-global parikh tree automata","author":"Herrmann","year":"2024"},{"key":"10.1016\/j.tcs.2026.115840_bib0013","unstructured":"M. Kracht, A New Proof of a Theorem by Ginsburg and Spanier, 2002. manuscript, https:\/\/wwwhomes.uni-bielefeld.de\/mkracht\/html\/presburger.pdf."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600099X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600099X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T12:51:53Z","timestamp":1777553513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600099X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":13,"alternative-id":["S030439752600099X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115840","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Global one-counter tree automata","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115840","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115840"}}