{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:26:03Z","timestamp":1725863163846},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319448015"},{"type":"electronic","value":"9783319448022"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44802-2_9","type":"book-chapter","created":{"date-parts":[[2016,8,17]],"date-time":"2016-08-17T16:32:52Z","timestamp":1471451572000},"page":"152-166","source":"Crossref","is-referenced-by-count":0,"title":["Maximally Parallel Contextual String Rewriting"],"prefix":"10.1007","author":[{"given":"Traian Florin","family":"\u015eerb\u0103nu\u0163\u0103","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liviu P.","family":"Dinu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,18]]},"reference":[{"issue":"10","key":"9_CR1","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s00236-002-0090-7","volume":"38","author":"P Bottoni","year":"2002","unstructured":"Bottoni, P., Mart\u00edn-Vide, C., P\u0103un, G., Rozenberg, G.: Membrane systems with promoters\/inhibitors. Acta Inform. 38(10), 695\u2013720 (2002)","journal-title":"Acta Inform."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187\u2013243 (2002). doi: 10.1016\/S0304-3975(01)00359-0","journal-title":"Theor. Comput. Sci."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-30586-6_7","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"A Dinu","year":"2005","unstructured":"Dinu, A., Dinu, L.P.: A parallel approach to syllabification. In: Gelbukh, A.F. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 83\u201387. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30586-6_7 . ISBN 3-540-24523-5"},{"issue":"4","key":"9_CR4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-2009-108","volume":"93","author":"LP Dinu","year":"2009","unstructured":"Dinu, L.P.: On insertion grammars with maximum parallel derivation. Fundam. Inf. 93(4), 357\u2013369 (2009)","journal-title":"Fundam. Inf."},{"key":"9_CR5","unstructured":"Galiukschov, B.S.: Semicontextual grammars. In: Matematika Logica i Matematika Linguistika, pp. 38\u201350. Tallin University (1981)"},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0926-6410(02)00149-0","volume":"15","author":"J-M Hopf","year":"2003","unstructured":"Hopf, J.-M., Bader, M., Meng, M., Bayer, J.: Is human sentence parsing serial or parallel? Evidence from event-related brain potentials. Cogn. Brain Res. 15(2), 165\u2013177 (2003)","journal-title":"Cogn. Brain Res."},{"issue":"1","key":"9_CR7","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, computability. Inf. Comput. 131(1), 47\u201361 (1996). ISSN 0890-5401","journal-title":"Inf. Comput."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Levelt, W.J.M., Indefrey, P.: The speaking mind\/brain: where do spoken words come from, pp. 77\u201393 (2000)","DOI":"10.7551\/mitpress\/3654.003.0007"},{"volume-title":"Automata, Languages, Development","year":"1976","key":"9_CR9","unstructured":"Lindenmayer, A., Rozenberg, G. (eds.): Automata, Languages, Development. North-Holland Publishing Co., Amsterdam (1976)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Marcus, S.: Contextual grammars. In: Proceedings of the 1969 Conference on Computational Linguistics, pp. 1\u201318. Association for Computational Linguistics (1969)","DOI":"10.3115\/990403.990451"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-662-07675-0_5","volume-title":"Handbook of Formal Languages","author":"S Marcus","year":"1997","unstructured":"Marcus, S.: Contextual grammars and natural languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 215\u2013235. Springer, Heidelberg (1997)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","volume-title":"CONCUR \u201996: Concurrency Theory","author":"J Meseguer","year":"1996","unstructured":"Meseguer, J.: Rewriting logic as a semantic framework for concurrency: a progress report. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 331\u2013372. Springer, Heidelberg (1996). ISBN 3-540-61604-7"},{"key":"9_CR13","first-page":"995","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning, vol. 45, p. 995. McGraw Hill, Burr Ridge (1997)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G P\u0103un","year":"2000","unstructured":"P\u0103un, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108\u2013143 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR15","volume-title":"The Algorithmic Beauty of Plants","author":"P Prusinkiewicz","year":"2012","unstructured":"Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer Science & Business Media, New York (2012)"},{"issue":"6","key":"9_CR16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.jlap.2010.03.012","volume":"79","author":"G Ro\u015fu","year":"2010","unstructured":"Ro\u015fu, G., \u015eerb\u0103nu\u0163\u0103, T.F.: An overview of the $$\\mathbb{K}$$ semantic framework. J. Log. Algebr. Program. 79(6), 397\u2013434 (2010)","journal-title":"J. Log. Algebr. Program."},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Visser, E., Benaissa, Z.A., Tolmach, A.: Building program optimizers with rewriting strategies. In: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, ICFP 1998, pp. 13\u201326. ACM, New York (1998). doi: 10.1145\/289423.289425 . ISBN 1-58113-024-4. http:\/\/doi.acm.org\/10.1145\/289423.289425","DOI":"10.1145\/289423.289425"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44802-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T22:20:24Z","timestamp":1718749224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44802-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319448015","9783319448022"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44802-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}