{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:23Z","timestamp":1779448283828,"version":"3.53.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,3,12]],"date-time":"2026-03-12T00:00:00Z","timestamp":1773273600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/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.115890","type":"journal-article","created":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T16:23:47Z","timestamp":1773419027000},"page":"115890","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On properties of languages accepted by deterministic pushdown automata with translucent input letters"],"prefix":"10.1016","volume":"1072","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-2625","authenticated-orcid":false,"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9589-5833","authenticated-orcid":false,"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7778-7257","authenticated-orcid":false,"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3948-4658","authenticated-orcid":false,"given":"Beatrice","family":"Palano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5491-3408","authenticated-orcid":false,"given":"Priscilla","family":"Raucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2243-549X","authenticated-orcid":false,"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115890_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2021.104687","article-title":"Nondeterministic right one-way jumping finite automata","volume":"284","author":"Beier","year":"2022","journal-title":"Inform. Comput."},{"key":"10.1016\/j.tcs.2026.115890_bib0002","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1016\/j.ic.2009.03.002","article-title":"On input-revolving deterministic and nondeterministic finite automata","volume":"207","author":"Bensch","year":"2009","journal-title":"Inform. Comput."},{"key":"10.1016\/j.tcs.2026.115890_bib0003","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0129054116400165","article-title":"One-way jumping finite automata","volume":"27","author":"Chigahara","year":"2016","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115890_bib0004","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/j.tcs.2026.115890_bib0005","series-title":"Fundamentals of Computation Theory (FCT 1995)","first-page":"283","article-title":"Restarting automata","author":"Jan\u010dar","year":"1995"},{"key":"10.1016\/j.tcs.2026.115890_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2021.104691","article-title":"Descriptional complexity of iterated uniform finite-state transducers","volume":"284","author":"Kutrib","year":"2022","journal-title":"Inform. Comput."},{"key":"10.1016\/j.tcs.2026.115890_bib0007","first-page":"59","article-title":"Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion","volume":"28","author":"Kutrib","year":"2023","journal-title":"J. Autom. Lang. Comb."},{"key":"10.1016\/j.tcs.2026.115890_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114049","article-title":"Iterated uniform finite-state transducers on unary languages","volume":"969","author":"Kutrib","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115890_bib0009","series-title":"Developments in Language Theory (DLT 2024)","first-page":"203","article-title":"Deterministic pushdown automata with translucent input letters","author":"Kutrib","year":"2024"},{"key":"10.1016\/j.tcs.2026.115890_bib0010","series-title":"Implementation and Application of Automata (CIAA 2024)","first-page":"208","article-title":"On properties of languages accepted by deterministic pushdown automata with translucent input letters","author":"Kutrib","year":"2024"},{"key":"10.1016\/j.tcs.2026.115890_bib0011","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1142\/S0129054112500244","article-title":"Jumping finite automata","volume":"23","author":"Meduna","year":"2012","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115890_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2024.114450","article-title":"Jump complexity of finite automata with translucent letters","volume":"992","author":"Mitrana","year":"2024","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115890_bib0013","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1051\/ita\/2023009","article-title":"Non-returning deterministic and nondeterministic finite automata with translucent letters","volume":"57","author":"Mr\u00e1z","year":"2023","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/j.tcs.2026.115890_bib0014","series-title":"AI Methods for Interdisciplinary Research in Language and Biology (BILC 2011)","first-page":"3","article-title":"Finite-state acceptors with translucent letters","author":"Nagy","year":"2011"},{"key":"10.1016\/j.tcs.2026.115890_bib0015","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.jcss.2011.12.009","article-title":"On CD-systems of stateless deterministic R-automata with window size one","volume":"78","author":"Nagy","year":"2012","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115890_bib0016","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00236-012-0175-x","article-title":"Deterministic pushdown-CD-systems of stateless deterministic r(1)-automata","volume":"50","author":"Nagy","year":"2013","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2026.115890_bib0017","series-title":"Implementation and Application of Automata (CIAA 2023)","first-page":"21","article-title":"A survey on automata with translucent letters","author":"Otto","year":"2023"},{"key":"10.1016\/j.tcs.2026.115890_bib0018","series-title":"Restarting Automata","author":"Otto","year":"2025"},{"key":"10.1016\/j.tcs.2026.115890_bib0019","series-title":"International Colloquium on Automata, Languages and Programming (ICALP 1977)","first-page":"453","article-title":"Linear time simulation of multihead turing machines with head-to-head jumps","author":"Savitch","year":"1977"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001490?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001490?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:02:34Z","timestamp":1779447754000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":19,"alternative-id":["S0304397526001490"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115890","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":"On properties of languages accepted by deterministic pushdown automata with translucent input letters","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115890","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":"115890"}}