{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T08:11:21Z","timestamp":1774080681948,"version":"3.50.1"},"reference-count":19,"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,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"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.115839","type":"journal-article","created":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:52:09Z","timestamp":1772207529000},"page":"115839","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Push complexity: Optimal bounds and decidability"],"prefix":"10.1016","volume":"1071","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7509-7842","authenticated-orcid":false,"given":"Giovanni","family":"Pighizzini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115839_bib0001","series-title":"Implementation and Application of Automata - 28th International Conference, CIAA 2024, Akita, Japan, September 3\u20136, 2024, Proceedings","first-page":"289","article-title":"Push complexity: optimal bounds and unary inputs","volume":"15015","author":"Pighizzini","year":"2024"},{"key":"10.1016\/j.tcs.2026.115839_bib0002","series-title":"6th Annual Symposium on Switching Circuit Theory and Logical Design, Ann Arbor, Michigan, USA, October 6\u20138, 1965","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965"},{"issue":"1","key":"10.1016\/j.tcs.2026.115839_bib0003","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321495.321508","article-title":"Some results on tape-bounded Turing machines","volume":"16","author":"Hopcroft","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115839_bib0004","series-title":"Fundamentals of Computation Theory, FCT \u201985, Cottbus, GDR, September 9\u201313, 1985","first-page":"1","article-title":"Space complexity of alternating Turing machines","volume":"199","author":"Alberts","year":"1985"},{"issue":"6","key":"10.1016\/j.tcs.2026.115839_bib0005","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(94)00056-5","article-title":"An optimal lower bound for nonregular languages","volume":"50","author":"Bertoni","year":"1994","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115839_bib0006","series-title":"Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS\u201995, Prague, Czech Republic, August 28\u2013 September 1, 1995, Proceedings","first-page":"309","article-title":"Strong optimal lower bounds for Turing machines that accept nonregular languages","volume":"969","author":"Bertoni","year":"1995"},{"issue":"4","key":"10.1016\/j.tcs.2026.115839_bib0007","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1142\/S012905410800598X","article-title":"Testing the descriptional power of small Turing machines on nonregular language acceptance","volume":"19","author":"Mereghetti","year":"2008","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115839_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2025.105329","article-title":"Pushdown and one-counter automata: constant and non-constant memory usage","volume":"306","author":"Pighizzini","year":"2025","journal-title":"Inf. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2026.115839_bib0009","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00236-022-00434-0","article-title":"Pushdown automata and constant height: decidability and bounds","volume":"60","author":"Pighizzini","year":"2023","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2026.115839_bib0010","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.jcss.2019.09.003","article-title":"On the degrees of non-regularity and non-context-freeness","volume":"108","author":"Bordihn","year":"2020","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2026.115839_bib0011","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1142\/S0129054116400098","article-title":"New results on the minimum amount of useful space","volume":"27","author":"Bedn\u00e1rov\u00e1","year":"2016","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115839_bib0012","series-title":"Descriptional Complexity of Formal Systems, DCFS 2019, Proceedings","first-page":"260","article-title":"Pushdown automata and constant height: decidability and bounds","volume":"11612","author":"Pighizzini","year":"2019"},{"issue":"3","key":"10.1016\/j.tcs.2026.115839_bib0013","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to ALGOL","volume":"9","author":"Ginsburg","year":"1962","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.tcs.2026.115839_bib0014","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1006\/jcss.2002.1855","article-title":"Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds","volume":"65","author":"Pighizzini","year":"2002","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115839_bib0015","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/j.tcs.2026.115839_bib0016","first-page":"143","article-title":"On formal properties of simple phrase structure grammars","volume":"14","author":"Bar-Hillel","year":"1961","journal-title":"Zeitschrift Phonet., Sprachwiss. Kommunikationsforsch."},{"issue":"2","key":"10.1016\/j.tcs.2026.115839_bib0017","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/322307.322315","article-title":"A generalization of Ogden\u2019s lemma","volume":"29","author":"Bader","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115839_bib0018","series-title":"Fundamentals of Computation Theory, 12th International Symposium, FCT \u201999, Iasi, Romania, August 30\u2013September 3, 1999, Proceedings","first-page":"226","article-title":"Strong iteration lemmata for regular, linear, context-free, and linear indexed languages","volume":"1684","author":"D\u00f6m\u00f6si","year":"1999"},{"issue":"6","key":"10.1016\/j.tcs.2026.115839_bib0019","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.1137\/S009753979935431X","article-title":"Optimal simulations between unary automata","volume":"30","author":"Mereghetti","year":"2001","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526000988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:36:30Z","timestamp":1774078590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526000988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":19,"alternative-id":["S0304397526000988"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115839","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":"Push complexity: Optimal bounds and decidability","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115839","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":"115839"}}