{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:42:29Z","timestamp":1776577349418,"version":"3.51.2"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","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,6]]},"DOI":"10.1016\/j.tcs.2026.115931","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:49:00Z","timestamp":1774928940000},"page":"115931","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Store languages of Turing machines and counter machines"],"prefix":"10.1016","volume":"1074","author":[{"given":"Noah","family":"Friesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jozef","family":"Jir\u00e1sek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7998-4430","authenticated-orcid":false,"given":"Ian","family":"McQuillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115931_bib0001","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1090\/S0002-9939-1967-0209086-1","article-title":"A note on pushdown store automata and regular systems","volume":"18","author":"Greibach","year":"1967","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/j.tcs.2026.115931_bib0002","series-title":"Handbook of Formal Languages","volume":"vol. 1","author":"Autebert","year":"1997"},{"key":"10.1016\/j.tcs.2026.115931_bib0003","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-3-642-31623-4_16","article-title":"Descriptional complexity of pushdown store languages","volume":"7386","author":"Malcher","year":"2012"},{"key":"10.1016\/j.tcs.2026.115931_bib0004","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-642-39310-5_10","article-title":"A direct construction of finite state automata for pushdown store languages","volume":"8031","author":"Geffert","year":"2013"},{"issue":"2","key":"10.1016\/j.tcs.2026.115931_bib0005","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1145\/321386.321403","article-title":"One-way stack automata","volume":"14","author":"Ginsburg","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115931_bib0006","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(78)90035-X","article-title":"One way finite visit automata","volume":"6","author":"Greibach","year":"1978","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115931_bib0007","series-title":"Developments in Language Theory","first-page":"361","article-title":"Flip-pushdown automata: nondeterminism is better than determinism","volume":"2710","author":"Holzer","year":"2003"},{"issue":"05","key":"10.1016\/j.tcs.2026.115931_bib0008","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1142\/S0129054117400081","article-title":"Deterministic stack transducers","volume":"28","author":"Bensch","year":"2017","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115931_bib0009","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.tcs.2018.05.036","article-title":"On store languages of language acceptors","volume":"745","author":"Ibarra","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115931_bib0010","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ic.2019.03.003","article-title":"On store languages and applications","volume":"267","author":"Ibarra","year":"2019","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.115931_bib0011","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"1","key":"10.1016\/j.tcs.2026.115931_bib0012","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.tcs.2026.115931_bib0013","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","article-title":"Reversal-bounded multipushdown machines","volume":"8","author":"Baker","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"10.1016\/j.tcs.2026.115931_bib0014","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","article-title":"Deterministic context free languages","volume":"9","author":"Ginsburg","year":"1966","journal-title":"Inf. Control"},{"issue":"1","key":"10.1016\/j.tcs.2026.115931_bib0015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(68)80003-0","article-title":"Deterministic stack automata and the quotient operator","volume":"2","author":"Hopcroft","year":"1968","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115931_bib0016","series-title":"CONCUR \u201997: Concurrency Theory: 8th International Conference Warsaw, Poland, July 1\u20134, 1997 Proceedings","first-page":"135","article-title":"Reachability analysis of pushdown automata: application to model-checking","volume":"1243","author":"Bouajjani","year":"1997"},{"key":"10.1016\/j.tcs.2026.115931_bib0017","series-title":"Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28, \u2014 September 1, 2000 Proceedings","first-page":"426","article-title":"Counter machines: decidable properties and applications to verification problems","author":"Ibarra","year":"2000"},{"key":"10.1016\/j.tcs.2026.115931_bib0018","series-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)","first-page":"216","article-title":"Global model checking of ordered multi-pushdown systems","volume":"8","author":"Atig","year":"2010"},{"key":"10.1016\/j.tcs.2026.115931_bib0019","series-title":"Proceedings of the 22nd International Conference on Computer Aided Verification","first-page":"615","article-title":"Global reachability in bounded phase multi-stack pushdown systems","author":"Seth","year":"2010"},{"key":"10.1016\/j.tcs.2026.115931_bib0020","series-title":"Proceedings of the 21st International Conference on Concurrency Theory, CONCUR\u201910","first-page":"117","article-title":"From multi to single stack automata","author":"Atig","year":"2010"},{"key":"10.1016\/j.tcs.2026.115931_bib0021","series-title":"CONCUR 2005 \u2014 Concurrency Theory","first-page":"473","article-title":"Regular symbolic analysis of dynamic networks of pushdown systems","author":"Bouajjani","year":"2005"},{"key":"10.1016\/j.tcs.2026.115931_bib0022","series-title":"STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17\u201319, 2000 Proceedings","first-page":"346","article-title":"Decidability of reachability problems for classes of two counters automata","author":"Finkel","year":"2000"},{"issue":"4","key":"10.1016\/j.tcs.2026.115931_bib0023","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/S0022-0000(72)80025-4","article-title":"Absolutely parallel grammars and two-way finite-state transducers","volume":"6","author":"Rajlich","year":"1972","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115931_bib0024","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/S0019-9958(79)90641-7","article-title":"Substitutions dans les EDT0L syst\u00e8mes ultralin\u00e9aires","volume":"42","author":"Latteux","year":"1979","journal-title":"Inf. Control"},{"key":"10.1016\/j.tcs.2026.115931_bib0025","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/S0019-9958(78)90635-6","article-title":"On the effect of the finite index restriction on several families of grammars","volume":"39","author":"Rozenberg","year":"1978","journal-title":"Inf. Control"},{"issue":"2","key":"10.1016\/j.tcs.2026.115931_bib0026","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1006\/jcss.2002.1836","article-title":"Some decision problems concerning semilinearity and commutation","volume":"65","author":"Harju","year":"2002","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115931_bib0027","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","article-title":"The complexity of decision problems for finite-turn multicounter machines","volume":"22","author":"Gurari","year":"1981","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115931_bib0028","series-title":"The Mathematical Theory of Context-Free Languages","author":"Ginsburg","year":"1966"},{"issue":"6","key":"10.1016\/j.tcs.2026.115931_bib0029","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1142\/S0129054112400539","article-title":"Characterizations of bounded semilinear languages by one-way and two-way deterministic machines","volume":"23","author":"Ibarra","year":"2012","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2026.115931_bib0030","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1137\/S0097539792240625","article-title":"New decidability results concerning two-way counter machines","volume":"23","author":"Ibarra","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.tcs.2026.115931_bib0031","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1142\/S0129054108006042","article-title":"On counter machines, reachability problems and diophantine equations","volume":"19","author":"Ibarra","year":"2008","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115931_bib0032","first-page":"189","article-title":"On the density of languages accepted by turing machines and other machine models","volume":"23","author":"Ibarra","year":"2018","journal-title":"J. Automata, Lang. Combinatorics"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:05:52Z","timestamp":1776575152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":32,"alternative-id":["S0304397526001908"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115931","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Store languages of Turing machines and counter machines","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115931","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115931"}}