{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T04:05:21Z","timestamp":1779509121276,"version":"3.53.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032026019","type":"print"},{"value":"9783032026026","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-02602-6_11","type":"book-chapter","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T08:34:02Z","timestamp":1755851642000},"page":"148-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subsequence Matching and\u00a0Analysis Problems for\u00a0Automata with\u00a0Translucent Letters"],"prefix":"10.1007","author":[{"given":"Szil\u00e1rd Zsolt","family":"Fazekas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B\u00e9la","family":"Klein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tore","family":"Ko\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timo","family":"Specht","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,23]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Adamson, D., Fleischmann, P., Huch, A., Ko\u00df, T., Manea, F.: k-universality of regular languages revisited. In: Chau, V., D\u00fcrr, C., Li, M., Lu, P. (eds.) Proceedings of 6th International Joint Conference on Theoretical Computer Science \u2013 19th Frontier of Algorithmic Wisdom (IJTCS FAW 2025). Lecture Notes in Computer Science, vol. 15828, pp. 16\u201332. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-8312-3_2","DOI":"10.1007\/978-981-96-8312-3_2"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Adamson, D., Fleischmann, P., Huch, A., Ko\u00df, T., Manea, F., Nowotka, D.: $$k$$-universality of regular languages. In: Proceedings of 34th International Symposium on Algorithms and Computation (ISAAC 2023). LIPIcs, vol.\u00a0283, pp. 4:1\u20134:21 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2023.4. https:\/\/arxiv.org\/abs\/2311.10658","DOI":"10.4230\/LIPIcs.ISAAC.2023.4"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-030-48516-0_2","volume-title":"Developments in Language Theory","author":"L Barker","year":"2020","unstructured":"Barker, L., Fleischmann, P., Harwardt, K., Manea, F., Nowotka, D.: Scattered factor-universality of words. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 14\u201328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_2"},{"issue":"3","key":"11_CR4","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(3), 391\u2013405 (2016). https:\/\/doi.org\/10.1142\/S0129054116400165","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Fazekas, S.Z., Ko\u00df, T., Manea, F., Merca\u015f, R., Specht, T.: Subsequence matching and analysis problems for formal languages. In: Proceedings of 35th International Symposium on Algorithms and Computation, (ISAAC 2024). LIPIcs, vol.\u00a0322, pp. 28:1\u201328:23 (2024). https:\/\/doi.org\/10.4230\/LIPICS.ISAAC.2024.28","DOI":"10.4230\/LIPICS.ISAAC.2024.28"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Fazekas, S.Z., Mitrana, V., Paun, A., Paun, M.: Jump complexity of deterministic finite automata with translucent letters. In: Anutariya, C., Bonsangue, M.M. (eds.) Proceedings of 21st International Colloquium on Theoretical Aspects of Computing, (ICTAC 2024). Lecture Notes in Computer Science, vol. 15373, pp. 62\u201377. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-77019-7_4","DOI":"10.1007\/978-3-031-77019-7_4"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(91)90170-7","volume":"82","author":"JJ H\u00e9brard","year":"1991","unstructured":"H\u00e9brard, J.J.: An algorithm for distinguishing efficiently bit-strings by their subsequences. Theor. Comput. Sci. 82(1), 35\u201349 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90170-7","journal-title":"Theor. Comput. Sci."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Combinatorial algorithms for subsequence matching: a survey. In: Proceedings of 12th International Workshop on Non-Classical Models of Automata and Applications, (NCMA 2022). EPTCS, vol.\u00a0367, pp. 11\u201327 (2022). https:\/\/doi.org\/10.4204\/EPTCS.367.2","DOI":"10.4204\/EPTCS.367.2"},{"issue":"7","key":"11_CR9","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(7), 1555\u20131578 (2012). https:\/\/doi.org\/10.1142\/S0129054112500244","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Mitrana, V., P\u0103un, A., P\u0103un, M., S\u00e1nchez-Couso, J.: Jump complexity of finite automata with translucent letters. Theor. Comput. Sci. 992, 114450 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114450","DOI":"10.1016\/j.tcs.2024.114450"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Nagy, B., Otto, F.: Finite-state acceptors with translucent letters. In: Proceedings of AI Methods for Interdisciplinary Research in Language and Biology (BILC 2011), pp. 3\u201313 (2011). https:\/\/doi.org\/10.5220\/0003272500030013","DOI":"10.5220\/0003272500030013"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Otto, F.: A survey on automata with translucent letters. In: Proceedings of 27th International Conference on Implementation and Application of Automata, (CIAA 2023), vol. 14151, pp. 21\u201350 (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","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02602-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T03:25:05Z","timestamp":1779506705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02602-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,23]]},"ISBN":["9783032026019","9783032026026"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02602-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,23]]},"assertion":[{"value":"23 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2025.unipa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}