{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:50:00Z","timestamp":1743011400573,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411132"},{"type":"electronic","value":"9783319411149"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41114-9_16","type":"book-chapter","created":{"date-parts":[[2016,6,27]],"date-time":"2016-06-27T10:05:14Z","timestamp":1467021914000},"page":"205-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two Results on Discontinuous Input Processing"],"prefix":"10.1007","author":[{"given":"Vojt\u011bch","family":"Vorel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alhazov, A., Krassovitskiy, A., Rogozhin, Y., Verlan, S.: Small size insertion and deletion systems. In: Martin-Vide, C. (ed.) Scientific Applications of Language Methods, pp. 459\u2013524. Imperial College Press (2010)","DOI":"10.1142\/9781848165458_0009"},{"key":"16_CR2","unstructured":"\u010cerno, P.: Clearing restarting automata and grammatical inference. In: Heinz, J., Colin de la Higuera, T.O. (eds.) Proceedings of the Eleventh International Conference on Grammatical Inference. JMLR Workshop and Conference Proceedings, vol. 21, pp. 54\u201368 (2012)"},{"issue":"1","key":"16_CR3","first-page":"17","volume":"104","author":"P \u010cerno","year":"2010","unstructured":"\u010cerno, P., Mr\u00e1z, F.: Clearing restarting automata. Fund. Inf. 104(1), 17\u201354 (2010)","journal-title":"Fund. Inf."},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoret. Comput. Sci. 27(3), 311\u2013332 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR5","unstructured":"Fernau, H., Paramasivan, M., Schmid, M., Vorel, V.: Characterization andcomplexity results on jumping finite automata. Accepted to Theoretical Computer Science (2015). \n                    http:\/\/arxiv.org\/abs\/1512.00482"},{"key":"16_CR6","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, Heidelberg (2015)"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0255(83)90023-3","volume":"31","author":"D Haussler","year":"1983","unstructured":"Haussler, D.: Insertion languages. Inf. Sci. 31(1), 77\u201389 (1983)","journal-title":"Inf. Sci."},{"key":"16_CR8","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley (2003)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(96)00307-6","volume":"183","author":"M Ito","year":"1997","unstructured":"Ito, M., Kari, L., Thierrin, G.: Insertion and deletion closure of languages. Theoret. Comput. Sci. 183(1), 3\u201319 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR10","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)"},{"issue":"4","key":"16_CR11","first-page":"316","volume":"26","author":"M Marcus","year":"1990","unstructured":"Marcus, M., P\u0103un, G.: Regulated Galiukschov semicontextual grammars. Kybernetika 26(4), 316\u2013326 (1990)","journal-title":"Kybernetika"},{"issue":"7","key":"16_CR12","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)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/978-1-4939-0369-6_17","volume-title":"Regulated Grammars and Automata","author":"Alexander Meduna","year":"2014","unstructured":"Meduna, A., Zemek, P.: Chapter 17 Jumping Finite Automata. In: Regulated Grammars and Automata, pp. 567\u2013585. Springer, New York (2014)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0037423","volume-title":"SOFSEM \u201996: Theory and Practice of Informatics","author":"F Mr\u00e1z","year":"1996","unstructured":"Mr\u00e1z, F., Pl\u00e1tek, M., Vogel, J.: Restarting automata with rewriting. In: Kr\u00e1l, J., Bartosek, M., Jeffery, K. (eds.) SOFSEM 1996. LNCS, vol. 1175, pp. 401\u2013408. Springer, Heidelberg (1996)"},{"issue":"5","key":"16_CR15","first-page":"360","volume":"21","author":"G P\u0103un","year":"1985","unstructured":"P\u0103un, G.: Two theorems about Galiukschov semicontextual languages. Kybernetika 21(5), 360\u2013365 (1985)","journal-title":"Kybernetika"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-662-03563-4_7","volume-title":"DNA Computing","author":"Gheorghe P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: Insertion-deletion systems. In: DNA Computing: New Computing Paradigms. Texts in Theoretical Computer Science, pp. 187\u2013215. Springer, Heidelberg (1998)"},{"key":"16_CR17","unstructured":"Vorel, V.: On basic properties of jumping finite automata. Int. J. Found. Comput. Sci., conditionally accepted in 2015. \n                    http:\/\/arxiv.org\/abs\/1511.08396"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41114-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:03:13Z","timestamp":1594598593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41114-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411132","9783319411149"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41114-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}