{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:15:16Z","timestamp":1768443316230,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031661587","type":"print"},{"value":"9783031661594","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_15","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"203-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Deterministic Pushdown Automata with\u00a0Translucent Input Letters"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-2625","authenticated-orcid":false,"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9589-5833","authenticated-orcid":false,"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7778-7257","authenticated-orcid":false,"given":"Carlo","family":"Mereghetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3948-4658","authenticated-orcid":false,"given":"Beatrice","family":"Palano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5491-3408","authenticated-orcid":false,"given":"Priscilla","family":"Raucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Wendlandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.jcss.2017.06.007","volume":"90","author":"Z Bedn\u00e1rov\u00e1","year":"2017","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: Boolean language operations on nondeterministic automata with a pushdown of constant height. J. Comput. Sys. Sci. 90, 99\u2013114 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.06.007","journal-title":"J. Comput. Sys. Sci."},{"key":"15_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/J.IC.2021.104687","volume":"284","author":"S Beier","year":"2022","unstructured":"Beier, S., Holzer, M.: Nondeterministic right one-way jumping finite automata. Inf. Comput. 284, 104687 (2022). https:\/\/doi.org\/10.1016\/J.IC.2021.104687","journal-title":"Inf. Comput."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.ic.2009.03.002","volume":"207","author":"S Bensch","year":"2009","unstructured":"Bensch, S., Bordihn, H., Holzer, M., Kutrib, M.: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207, 1140\u20131155 (2009). https:\/\/doi.org\/10.1016\/j.ic.2009.03.002","journal-title":"Inf. Comput."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2014.07.004","volume":"551","author":"MP Bianchi","year":"2014","unstructured":"Bianchi, M.P., Mereghetti, C., Palano, B.: Size lower bounds for quantum automata. Theor. Comput. Sci. 551, 102\u2013115 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.07.004","journal-title":"Theor. Comput. Sci."},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3233\/FI-2011-583","volume":"112","author":"MP Bianchi","year":"2011","unstructured":"Bianchi, M.P., Mereghetti, C., Palano, B., Pighizzini, G.: On the size of unary probabilistic and nondeterministic automata. Fund. Inform. 112, 119\u2013135 (2011). https:\/\/doi.org\/10.3233\/FI-2011-583","journal-title":"Fund. Inform."},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2681","volume":"141","author":"G Buntrock","year":"1998","unstructured":"Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Inf. Comput. 141, 1\u201336 (1998). https:\/\/doi.org\/10.1006\/inco.1997.2681","journal-title":"Inf. Comput."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/S0129054116400165","volume":"27","author":"H Chigahara","year":"2016","unstructured":"Chigahara, H., Fazekas, S.Z., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27, 391\u2013405 (2016). https:\/\/doi.org\/10.1142\/S0129054116400165","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/0022-0000(86)90062-0","volume":"33","author":"E Dahlhaus","year":"1986","unstructured":"Dahlhaus, E., Warmuth, M.K.: Membership for growing context-sensitive grammars is polynomial. J. Comput. Syst. Sci. 33, 456\u2013472 (1986). https:\/\/doi.org\/10.1016\/0022-0000(86)90062-0","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Greibach, S.A.: Deterministic context-free languages. Inf. Control 9, 620\u2013648 (1966). https:\/\/doi.org\/10.1016\/S0019-9958(66)80019-0","journal-title":"Inf. Control"},{"key":"15_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-39310-5_13","volume-title":"Descriptional Complexity of Formal Systems","author":"S Jakobi","year":"2013","unstructured":"Jakobi, S., Meckel, K., Mereghetti, C., Palano, B.: Queue automata of constant length. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol. 8031, pp. 124\u2013135. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39310-5_13"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-60249-6_60","volume-title":"Fundamentals of Computation Theory","author":"P Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P., Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283\u2013292. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60249-6_60"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-51466-2_8","volume-title":"Beyond the Horizon of Computability","author":"M Kutrib","year":"2020","unstructured":"Kutrib, M., Malcher, A., Mereghetti, C., Palano, B.: Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power. In: Anselmo, M., Della Vedova, G., Manea, F., Pauly, A. (eds.) CiE 2020. LNCS, vol. 12098, pp. 87\u201399. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51466-2_8"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. J. ACM 35, 324\u2013344 (1988). https:\/\/doi.org\/10.1145\/42282.42284","journal-title":"J. ACM"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1142\/S0129054112500244","volume":"23","author":"A Meduna","year":"2012","unstructured":"Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23, 1555\u20131578 (2012). https:\/\/doi.org\/10.1142\/S0129054112500244","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114450","volume":"992","author":"V Mitrana","year":"2024","unstructured":"Mitrana, V., P\u01ceun, A., P\u01ceun, M., Couso, J.R.S.: Jump complexity of finite automata with translucent letters. Theor. Comput. Sci. 992, 114450 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114450","journal-title":"Theor. Comput. Sci."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1051\/ita\/2023009","volume":"57","author":"F Mr\u00e1z","year":"2023","unstructured":"Mr\u00e1z, F., Otto, F.: Non-returning deterministic and nondeterministic finite automata with translucent letters. RAIRO Theor. Inform. Appl. 57, 8 (2023). https:\/\/doi.org\/10.1051\/ita\/2023009","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1051\/ITA\/2011123","volume":"45","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO Theor. Inform. Appl. 45, 413\u2013448 (2011). https:\/\/doi.org\/10.1051\/ITA\/2011123","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Nagy, B., Otto, F.: Finite-state acceptors with translucent letters. In: Bel-Enguix, G., Dahl, V., De\u00a0La\u00a0Puente, A. (eds.) International Workshop on AI Methods for Interdisciplinary Research in Language and Biology (BILC 2011), pp. 3\u201313. SciTePress (2011). https:\/\/doi.org\/10.5220\/0003272500030013","DOI":"10.5220\/0003272500030013"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/J.JCSS.2011.12.009","volume":"78","author":"B Nagy","year":"2012","unstructured":"Nagy, B., Otto, F.: On CD-systems of stateless deterministic R-automata with window size one. J. Comput. Syst. Sci. 78, 780\u2013806 (2012). https:\/\/doi.org\/10.1016\/J.JCSS.2011.12.009","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/S00236-012-0175-X","volume":"50","author":"B Nagy","year":"2013","unstructured":"Nagy, B., Otto, F.: Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Acta Inform. 50, 229\u2013255 (2013). https:\/\/doi.org\/10.1007\/S00236-012-0175-X","journal-title":"Acta Inform."},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.09.003","volume":"197","author":"G Niemann","year":"2005","unstructured":"Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inf. Comput. 197, 1\u201321 (2005). https:\/\/doi.org\/10.1016\/j.ic.2004.09.003","journal-title":"Inf. Comput."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-45007-6_5","volume-title":"Developments in Language Theory","author":"F Otto","year":"2003","unstructured":"Otto, F.: Restarting automata and their relations to the Chomsky hierarchy. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 55\u201374. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45007-6_5"},{"key":"15_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-031-40247-0_2","volume-title":"Implementation and Application of Automata (CIAA 2023)","author":"F Otto","year":"2023","unstructured":"Otto, F.: A survey on automata with translucent letters. In: Nagy, B. (ed.) CIAA 2023. LNCS, vol. 14151, pp. 21\u201350. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40247-0_2"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66159-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:03:43Z","timestamp":1729325023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}