{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:45:19Z","timestamp":1782636319575,"version":"3.54.5"},"reference-count":27,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.446.5","type":"journal-article","created":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:24:52Z","timestamp":1782635092000},"page":"73-87","source":"Crossref","is-referenced-by-count":0,"title":["On some Open Problems for Finite Automata with Translucent Input Letters"],"prefix":"10.4204","volume":"446","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[{"name":"University of Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[{"name":"University of Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[{"name":"University of Giessen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2720","published-online":{"date-parts":[[2026,6,25]]},"reference":[{"key":"beier:2022:nrowjfa","doi-asserted-by":"publisher","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":"bensch:2009:irdnfa","doi-asserted-by":"publisher","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":"chigahara:2016:owjfa","doi-asserted-by":"publisher","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":"smaapfawtl:2025:proc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-032-02602-6_11","article-title":"Subsequence Matching and Analysis Problems for Automata with Translucent Letters","volume-title":"Implementation and Application of Automata (CIAA 2025)","author":"Fazekas","year":"2025"},{"key":"jcodfawtl:2024:proc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-031-77019-7_4","article-title":"Jump Complexity of Deterministic Finite Automata with Translucent Letters","volume-title":"Theoretical Aspects of Computing (ICTAC 2024)","author":"Fazekas","year":"2024"},{"key":"Hopcroft:1979:itatlc:book","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"Jancar:1995:ra:proc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-60249-6_60","article-title":"Restarting automata","volume-title":"Fundamentals of Computation Theory (FCT 1995)","volume":"965","author":"Jan\u010dar","year":"1995"},{"key":"kutrib:2026:twfawtl","article-title":"Two-Way Finite Automata with Translucent Input Letters","author":"Kutrib","year":"2026","journal-title":"submitted for journal publication"},{"issue":"4","key":"kutrib:2022:cadponiufst","doi-asserted-by":"publisher","first-page":"337","DOI":"10.3233\/FI-222113","article-title":"Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers","volume":"185","author":"Kutrib","year":"2022","journal-title":"Fundam. Informaticae"},{"key":"kutrib:2025:twfawtil:proc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-031-97100-6_11","article-title":"Two-Way Finite Automata with Translucent Input Letters","volume-title":"Descriptional Complexity of Formal Systems (DCFS 2025)","volume":"15759","author":"Kutrib","year":"2025"},{"key":"kutrib:2026:dpawtil","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2026.105403","article-title":"Deterministic pushdown automata with translucent input letters","volume":"308","author":"Kutrib","year":"2026","journal-title":"Inf. Comput."},{"key":"kutrib:2026:opolabdpawtil","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2026.115890","article-title":"On properties of languages accepted by deterministic pushdown automata with translucent input letters","volume":"1072","author":"Kutrib","year":"2026","journal-title":"Theor. Comput. Sci."},{"key":"kutrib:2025:idpawtil","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"29","DOI":"10.4204\/EPTCS.422.3","article-title":"Input-Driven Pushdown Automata with Translucent Input Letters","volume-title":"Non-Classical Models of Automata and Applications, (NCMA 2025)","author":"Kutrib","year":"2025"},{"key":"Mealy:1955:amfssc","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.2307\/2963669","article-title":"A method for synthesizing sequential circuits","volume":"34","author":"Mealy","year":"1955","journal-title":"Bell Syst. Tech. J."},{"key":"meduna:2012:jfa","doi-asserted-by":"publisher","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":"mitrana:2024:jcofawtl","doi-asserted-by":"publisher","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":"Theoretical Computer Science"},{"key":"mraz:2023:nrfawtl","doi-asserted-by":"publisher","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":"mraz:2024:rfawtl:proc","series-title":"EPTCS","doi-asserted-by":"publisher","first-page":"150","DOI":"10.4204\/EPTCS.407.11","article-title":"Repetitive Finite Automata With Translucent Letters","volume-title":"Non-Classical Models of Automata and Applications (NCMA 2024)","volume":"407","author":"Mr\u00e1z","year":"2024"},{"key":"nagy:2011:cdsosdragbaeps","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1051\/ITA\/2011123","article-title":"CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store","volume":"45","author":"Nagy","year":"2011","journal-title":"RAIRO Theor. Informatics Appl."},{"key":"nagy:2011:fsawtl","doi-asserted-by":"publisher","first-page":"3","DOI":"10.5220\/0003272500030013","article-title":"Finite-state Acceptors with Translucent Letters","volume-title":"International Workshop on AI Methods for Interdisciplinary Research in Language and Biology (BILC 2011)","author":"Nagy","year":"2011"},{"issue":"3","key":"nagy:2012:oncdsosdrawwso","doi-asserted-by":"publisher","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":"Nagy:2013:dpcdsosdra","doi-asserted-by":"publisher","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":"nagy:2013:gdcdssdr","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1080\/00207160.2012.688820","article-title":"Globally deterministic CD-systems of stateless R-automata with window size 1","volume":"90","author":"Nagy","year":"2013","journal-title":"Internat. J. Comput. Math."},{"key":"Nagy:2024:fawsotw","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-031-66159-4_17","article-title":"Finite Automata with Sets of Translucent Words","volume-title":"Developments in Language Theory (DLT 2024)","volume":"14791","author":"Nagy","year":"2024"},{"key":"Otto:2015:ovptl","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-662-46078-8_32","article-title":"On Visibly Pushdown Trace Languages","volume-title":"SOFSEM 2015","volume":"8939","author":"Otto","year":"2015"},{"key":"otto:2023:asoawtl:proc","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-031-40247-0_2","article-title":"A Survey on automata with translucent letters","volume-title":"Implementation and Application of Automata (CIAA 2023)","volume":"14151","author":"Otto","year":"2023"},{"key":"otto:2025:book","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-78701-0","volume-title":"Restarting Automata","author":"Otto","year":"2025"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:25:00Z","timestamp":1782635100000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2606.26683v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":27,"URL":"https:\/\/doi.org\/10.4204\/eptcs.446.5","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]}}}