{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:22Z","timestamp":1725468502452},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055818","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"674-682","source":"Crossref","is-referenced-by-count":3,"title":["On defect effect of bi-infinite words"],"prefix":"10.1007","author":[{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Plandowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"Choffrut, C., Karhum\u00e4ki, J., Combinatorics of words, in G. Rozenberg and A. Salomaa (eds), Handbook of Formal Languages, Springer, 1997.","DOI":"10.1007\/978-3-642-59136-5_6"},{"key":"65_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(85)90060-X","volume":"41","author":"E. Rest Le","year":"1985","unstructured":"Le Rest, E., Le Rest, M. Sur la combinatoire des codes a deux mots, Theoretical Computer Science 41, 61\u201380, 1985.","journal-title":"Theoretical Computer Science"},{"key":"65_CR3","unstructured":"Lothaire, M., Combinatorics on words, Addison-Wesley, 1983."},{"key":"65_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02573193","volume":"33","author":"T. Harju","year":"1986","unstructured":"Harju, T., Karhum\u00e4ki, J., On the defect theorem and simplifiability, Semigroup Forum 33, 199\u2013217, 1986.","journal-title":"Semigroup Forum"},{"key":"65_CR5","unstructured":"Lentin, A., Sch\u00fctzenberger, M.P., A combinatorial problem in the theory of free monoids, Proc. University of North Carolina, 128\u2013144, 1967."},{"key":"65_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M. P., The equation a m = b n c p in a free group, Michigan Mathematical Journal 9, 289\u2013298, 1962.","journal-title":"Michigan Mathematical Journal"},{"key":"65_CR7","doi-asserted-by":"crossref","unstructured":"Karhum\u00e4ki, J., Ma\u0148uch, J., Plandowski, W., On defect effect of bi-infinite words, TUCS Report 181, 1998.","DOI":"10.1007\/BFb0055818"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:44:29Z","timestamp":1555771469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0055818","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}