{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:10Z","timestamp":1725745270486},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405785"},{"type":"electronic","value":"9783642405792"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40579-2_24","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T10:24:48Z","timestamp":1376475888000},"page":"229-237","source":"Crossref","is-referenced-by-count":0,"title":["Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants"],"prefix":"10.1007","author":[{"given":"Aleksi","family":"Saarela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139195768"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2012.04.045","volume":"448","author":"D. Freydenberger","year":"2012","unstructured":"Freydenberger, D., Nevisi, H., Reidenbach, D.: Weakly unambiguous morphisms. Theoret. Comput. Sci.\u00a0448, 21\u201340 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"14","key":"24_CR3","doi-asserted-by":"publisher","first-page":"3055","DOI":"10.1016\/j.dam.2009.06.009","volume":"157","author":"D. Freydenberger","year":"2009","unstructured":"Freydenberger, D., Reidenbach, D.: The unambiguity of segmented morphisms. Discrete Appl. Math.\u00a0157(14), 3055\u20133068 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1142\/S0129054106004017","volume":"17","author":"D. Freydenberger","year":"2006","unstructured":"Freydenberger, D., Reidenbach, D., Schneider, J.: Unambiguous morphic images of strings. Internat. J. Found. Comput. Sci.\u00a017(3), 601\u2013628 (2006)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Harju, T., Karhum\u00e4ki, J.: Morphisms. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 439\u2013510. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_7"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/00207168108803273","volume":"10","author":"T. Head","year":"1981","unstructured":"Head, T.: Fixed languages and the adult languages of 0L schemes. Int. J. Comput. Math.\u00a010(2), 103\u2013107 (1981)","journal-title":"Int. J. Comput. Math."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Mateescu, A., Salomaa, A.: Aspects of classical language theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 175\u2013251. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_4"},{"issue":"1-3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2008.02.029","volume":"397","author":"D. Reidenbach","year":"2008","unstructured":"Reidenbach, D.: Discontinuities in pattern inference. Theoret. Comput. Sci.\u00a0397(1-3), 166\u2013193 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"29","key":"24_CR9","doi-asserted-by":"publisher","first-page":"3510","DOI":"10.1016\/j.tcs.2011.02.041","volume":"412","author":"D. Reidenbach","year":"2011","unstructured":"Reidenbach, D., Schneider, J.: Restricted ambiguity of erasing morphisms. Theoret. Comput. Sci.\u00a0412(29), 3510\u20133523 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"24_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1051\/ita\/2009020","volume":"44","author":"J. Schneider","year":"2010","unstructured":"Schneider, J.: Unambiguous erasing morphisms in free monoids. RAIRO Inform. Theor. Appl.\u00a044(2), 193\u2013208 (2010)","journal-title":"RAIRO Inform. Theor. Appl."},{"issue":"1-2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1016\/S0304-3975(01)00092-5","volume":"270","author":"J. Shallit","year":"2002","unstructured":"Shallit, J., Wang, M.W.: On two-sided infinite fixed points of morphisms. Theoret. Comput. Sci.\u00a0270(1-2), 659\u2013675 (2002)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40579-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:45:14Z","timestamp":1558021514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40579-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405785","9783642405792"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40579-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}