{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:49Z","timestamp":1725543469957},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_36","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"397-407","source":"Crossref","is-referenced-by-count":1,"title":["Factorial Languages of Low Combinatorial Complexity"],"prefix":"10.1007","author":[{"given":"Arseny M.","family":"Shur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1051\/ita:2005003","volume":"39","author":"J. Balogh","year":"2005","unstructured":"Balogh, J., Bollobas, B.: Hereditary properties of words. RAIRO \u2013 Inf. Theor. Appl.\u00a039, 49\u201365 (2005)","journal-title":"RAIRO \u2013 Inf. Theor. Appl."},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(88)90009-6","volume":"23","author":"F.-J. Brandenburg","year":"1983","unstructured":"Brandenburg, F.-J.: Uniformly growing k-th power free homomorphisms. Theor. Comput. Sci.\u00a023, 69\u201382 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of formal languages, ch. 6","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rosenberg, G., Salomaa, A. (eds.) Handbook of formal languages, ch. 6, vol.\u00a01, pp. 329\u2013438. Springer, Berlin (1997)"},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M. Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inform. Processing Letters\u00a067(3), 111\u2013117 (1998)","journal-title":"Inform. Processing Letters"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(86)90116-7","volume":"44","author":"Y. Kobayashi","year":"1986","unstructured":"Kobayashi, Y.: Repetition-free words. Theor. Comp. Sci.\u00a044, 175\u2013197 (1986)","journal-title":"Theor. Comp. Sci."},{"key":"36_CR6","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)"},{"issue":"2","key":"36_CR7","first-page":"78","volume":"1, 12","author":"A.M. Shur","year":"2005","unstructured":"Shur, A.M.: Combinatorial complexity of rational languages (Russian). Discr. Anal. and Oper. Research, Ser.\u00a01, 12(2), 78\u201399 (2005)","journal-title":"Discr. Anal. and Oper. Research, Ser."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:54Z","timestamp":1619507754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11779148_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}