{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:45:29Z","timestamp":1794339929786,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_5","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"18-22","source":"Crossref","is-referenced-by-count":4,"title":["Canonical Decomposition of a Regular Factorial Language"],"prefix":"10.1007","author":[{"given":"S. V.","family":"Avgustinovich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. E.","family":"Frid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1142\/S0218196705002116","volume":"15","author":"S.V. Avgustinovich","year":"2005","unstructured":"Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Internat. J. Algebra Comput.\u00a015, 149\u2013160 (2005)","journal-title":"Internat. J. Algebra Comput."},{"key":"5_CR2","volume-title":"Regular Algebra and Finite Machines","author":"J.H. Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-540-31856-9_47","volume-title":"STACS 2005","author":"M. Kunc","year":"2005","unstructured":"Kunc, M.: The power of commuting with finite sets of words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 569\u2013580. Springer, Heidelberg (2005)"},{"key":"5_CR4","unstructured":"Sakarovitch, J.: Elements de theorie des automates, Vuibert (2003)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1142\/9789812792464_0003","volume-title":"Developments in Language Theory. Foundations, Applications, Perspectives","author":"A. Salomaa","year":"2000","unstructured":"Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Developments in Language Theory. Foundations, Applications, Perspectives, pp. 22\u201331. World Scientific, Singapore (2000)"},{"key":"5_CR6","unstructured":"Shur, A.M.: Subword complexity of rational languages. Discrete Analisys and Operation Research\u00a012(2), 78\u201399 (2005) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:47Z","timestamp":1619492627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11753728_5","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}