{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:55:46Z","timestamp":1743126946896,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_2","type":"book-chapter","created":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T02:42:00Z","timestamp":1502851320000},"page":"10-19","source":"Crossref","is-referenced-by-count":0,"title":["1-Normal DRA for Insertion Languages"],"prefix":"10.1007","author":[{"given":"Abhisek","family":"Midya","sequence":"first","affiliation":[]},{"given":"Lakshmanan","family":"Kuppusamy","sequence":"additional","affiliation":[]},{"given":"V. S.","family":"Sumitha","sequence":"additional","affiliation":[]},{"given":"Alok Kumar","family":"Pani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"key":"2_CR1","unstructured":"Jancar, P., Mraz, F., Platek, M., Prochazka, M., Vogel, J.: Deleting automata with a restart operation. In: Bozapalidis, S. (ed.) Proceedings of Developments in Language language theory III(97), Thessaloniki, pp. 191\u2013202 (1998)"},{"key":"2_CR2","unstructured":"Jancar, P., Mraz, F., Platek, M., Prochazka, M., Vogel, J.: Restarting automata, marcus grammars and context-free languages. In: Dassow, J., Rozenberg, G., Salomaa, A. (eds.) Developments in Language Theory, pp. 102\u2013111. World Scientific Publishing (1996)"},{"key":"2_CR3","unstructured":"Haussler, D.: Insertion and Iterated Insertion as Operations on Formal Languages. Ph.D. Thesis, University of Colorado, Boulder (1982)"},{"issue":"1","key":"2_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0255(83)90023-3","volume":"131","author":"D Haussler","year":"1983","unstructured":"Haussler, D.: Insertion languages. Inf. Sci. 131(1), 77\u201389 (1983)","journal-title":"Inf. Sci."},{"key":"2_CR5","unstructured":"Galiukschov, B.S.: Semicontextual grammars (in Russian). MAT. Logica i Mat. Ling. 38\u201350 (1981)"},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1006\/inco.1996.0091","volume":"131","author":"L Kari","year":"1996","unstructured":"Kari, L., Thierrin, G.: Contextual insertions\/deletions and computability. Inf. Comput. 131(1), 47\u201361 (1996)","journal-title":"Inf. Comput."},{"key":"2_CR7","first-page":"23","volume":"27","author":"MP Chytil","year":"1985","unstructured":"Chytil, M.P., Platek, M., Vogel, J.: A note on the Chomsky hierarchy. Bull. EATCS 27, 23\u201330 (1985)","journal-title":"Bull. EATCS"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/3-540-57182-5_44","volume-title":"Mathematical Foundations of Computer Science 1993","author":"P Jancar","year":"1993","unstructured":"Jancar, P., Mr\u00e1z, F., Pl\u00e1tek, M.: A taxonomy of forgetting automata. In: Borzyszkowski, A.M., Soko\u0142owski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 527\u2013536. Springer, Heidelberg (1993). doi: 10.1007\/3-540-57182-5_44"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Marcus, S.: Contextual Grammars. Revue Roumane de Mathematiques Pures et Appliques 14(10), 1525\u20131534 (1969)","DOI":"10.3115\/990403.990451"},{"key":"2_CR10","first-page":"641","volume":"25","author":"G Paun","year":"1980","unstructured":"Paun, G., Nguyen, X.M.: On the inner contextual grammars. Rev. Roum. Pures. Appl. 25, 641\u2013651 (1980)","journal-title":"Rev. Roum. Pures. Appl."},{"key":"2_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-8969-7","volume-title":"Marcus Contextual Grammars","author":"G Paun","year":"1997","unstructured":"Paun, G.: Marcus Contextual Grammars. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.3233\/FI-2010-334","volume":"104","author":"P Cerno","year":"2010","unstructured":"Cerno, P., Mr\u00e1z, F.: Clearing restarting automata. Fundam. Inform. 104, 17\u201354 (2010)","journal-title":"Fundam. Inform."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T08:34:14Z","timestamp":1602750854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}