{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:39Z","timestamp":1725491439015},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_19","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"181-192","source":"Crossref","is-referenced-by-count":2,"title":["The Unambiguity of Segmented Morphisms"],"prefix":"10.1007","author":[{"given":"Dominik D.","family":"Freydenberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Reidenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0304-3975(89)90071-6","volume":"69","author":"K.A. Baker","year":"1989","unstructured":"Baker, K.A., McNulty, G.F., Taylor, W.: Growth problems for avoidable words. Theor. Comput. Sci.\u00a069, 319\u2013345 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Cassaigne, J.: Unavoidable patterns. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words, pp. 111\u2013134. Cambridge Mathematical Library (2002)","DOI":"10.1017\/CBO9781107326019.004"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0020-0190(79)90135-2","volume":"9","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Finding a homomorphism between two words is NP-complete. Inform. Process. Lett.\u00a09, 86\u201388 (1979)","journal-title":"Inform. Process. Lett."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1142\/S0129054106004017","volume":"17","author":"D.D. Freydenberger","year":"2006","unstructured":"Freydenberger, D.D., Reidenbach, D., Schneider, J.C.: Unambiguous morphic images of strings. Int. J. Found. Comput. Sci.\u00a017, 601\u2013628 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR6","unstructured":"Halava, V., Harju, T., Karhum\u00e4ki, J., Latteux, M.: Post Correspondence Problem for morphisms with unique blocks. In: Proc. Words 2005. Publications du LACIM, vol.\u00a036, pp. 265\u2013274 (2005)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Hamm, D., Shallit, J.: Characterization of finite and one-sided infinite fixed points of morphisms on free monoids. Technical Report CS-99-17, Dep. of Computer Science, University of Waterloo (1999)","DOI":"10.1007\/3-540-48321-7_41"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jcss.1995.1006","volume":"50","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. J. Comput. Syst. Sci.\u00a050, 53\u201363 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR9","first-page":"230","volume-title":"Handbook of Formal Languages","author":"A. Mateescu","year":"1997","unstructured":"Mateescu, A., Salomaa, A.: Patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 230\u2013242. Springer, Heidelberg (1997)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-540-24749-4_12","volume-title":"STACS 2004","author":"D. Reidenbach","year":"2004","unstructured":"Reidenbach, D.: A discontinuity in pattern inference. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 129\u2013140. Springer, Heidelberg (2004)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2005.10.017","volume":"350","author":"D. Reidenbach","year":"2006","unstructured":"Reidenbach, D.: A non-learnable class of E-pattern languages. Theor. Comput. Sci.\u00a0350, 91\u2013102 (2006)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T03:51:37Z","timestamp":1684036297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}