{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:54:30Z","timestamp":1777100070187,"version":"3.51.4"},"publisher-location":"Cham","reference-count":11,"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_17","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"236-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finite Automata with\u00a0Sets of\u00a0Translucent Words"],"prefix":"10.1007","author":[{"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-22360-5_8","volume-title":"Implementation and Application of Automata","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L.: Jumping finite automata: characterizations and complexity. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 89\u2013101. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22360-5_8"},{"key":"17_CR2","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading, M.A. (1978)978-0-201-02955-0"},{"key":"17_CR3","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":"17_CR4","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":"17_CR5","doi-asserted-by":"publisher","unstructured":"Nagy, B.: State-deterministic finite automata with translucent letters and finite automata with nondeterministically translucent letters. In: Gazdag, Z., Szabolcs, I., Kov\u00e1sznai, G. (eds.) 16th International Conference on Automata and Formal Languages (AFL 2023), EPTCS, vol.\u00a0386, pp. 170\u2013184 (2023). https:\/\/doi.org\/10.4204\/EPTCS.386.14","DOI":"10.4204\/EPTCS.386.14"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-13089-2_39","volume-title":"Language and Automata Theory and Applications","author":"B Nagy","year":"2010","unstructured":"Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata accept all rational trace languages. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 463\u2013474. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13089-2_39"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Nagy, B., Otto, F.: Finite-state acceptors with translucent letters. In: Bel-Enguix, G., Dahl, V., De La Puente, A.O. (eds.) BILC 2011: AI Methods for Interdisciplinary Research in Language and Biology, Proceedings, pp. 3\u201313. SciTePress, Portugal (2011). https:\/\/doi.org\/10.5220\/0003272500030013","DOI":"10.5220\/0003272500030013"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-21254-3_31","volume-title":"Language and Automata Theory and Applications","author":"B Nagy","year":"2011","unstructured":"Nagy, B., Otto, F.: Globally deterministic CD-systems of stateless R(1)-automata. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 390\u2013401. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_31"},{"key":"17_CR9","doi-asserted-by":"publisher","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.jcss2011.12.009","DOI":"10.1016\/j.jcss2011.12.009"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1080\/00207160.2012.688820","volume":"90","author":"B Nagy","year":"2013","unstructured":"Nagy, B., Otto, F.: Globally deterministic CD-systems of stateless R-automata with window size 1. Int. J. Comput. Math. 90, 1254\u20131277 (2013). https:\/\/doi.org\/10.1080\/00207160.2012.688820","journal-title":"Int. J. Comput. Math."},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Otto, F.: A survey on automata with translucent letters. In: Nagy, B. (ed.) Implementation and Application of Automata, CIAA 2023, LNCS, vol. 14151, pp. 21\u201350. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40247-0_2","DOI":"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:03:56Z","timestamp":1729325036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_17","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"}}]}}