{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:00:07Z","timestamp":1725534007279},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_17","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T12:40:30Z","timestamp":1246365630000},"page":"221-227","source":"Crossref","is-referenced-by-count":0,"title":["Powers of Regular Languages"],"prefix":"10.1007","author":[{"given":"Szil\u00e1rd Zsolt","family":"Fazekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-88282-4_7","volume-title":"Language and Automata Theory and Applications","author":"T. Anderson","year":"2008","unstructured":"Anderson, T., Rampersad, N., Santean, N., Shallit, J.: Finite Automata, Palindromes, Powers, and Patterns. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 52\u201363. Springer, Heidelberg (2008)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-46011-X_11","volume-title":"Developments in Language Theory","author":"T. Cachat","year":"2002","unstructured":"Cachat, T.: The Power of One-Letter Rational Languages. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 145\u2013154. Springer, Heidelberg (2002)"},{"key":"17_CR3","first-page":"341","volume-title":"Developments in Language Theory 1995","author":"H. Calbrix","year":"1996","unstructured":"Calbrix, H., Nivat, M.: Prefix and Period Languages of Rational omega-Languages. In: Dassow, J., Rozenberg, G., Salomaa, A. (eds.) Developments in Language Theory 1995, pp. 341\u2013349. World Scientific, Singapore (1996)"},{"issue":"3-4","key":"17_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.5486\/PMD.2004.2775","volume":"64","author":"P. D\u00f6m\u00f6si","year":"2004","unstructured":"D\u00f6m\u00f6si, P., Horv\u00e1th, G., Ito, M.: A small hierarchy of languages consisting of non-primitive words. Publ. Math. Debrecen\u00a064(3-4), 261\u2013267 (2004)","journal-title":"Publ. Math. Debrecen"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-45005-X_19","volume-title":"Developments in Language Theory","author":"S. Horv\u00e1th","year":"2003","unstructured":"Horv\u00e1th, S., Leupold, P., Lischke, G.: Roots and Powers of Regular Languages. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 220\u2013230. Springer, Heidelberg (2003)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-46011-X_23","volume-title":"Developments in Language Theory","author":"G. Lischke","year":"2002","unstructured":"Lischke, G.: The root of a language and its complexity. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 272\u2013280. Springer, Heidelberg (2002)"},{"key":"17_CR7","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.: On the equation a M \u2009=\u2009b N c P in a free group. Michigan Math. Journ.\u00a09, 289\u2013298 (1962)","journal-title":"Michigan Math. Journ."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Develop.\u00a03, 114\u2013125 (1959)","journal-title":"IBM J. Res. Develop."},{"key":"17_CR9","first-page":"535","volume":"20","author":"H.J. Shyr","year":"1994","unstructured":"Shyr, H.J., Yu, S.S.: Non-primitive words in the language p \u2009+\u2009 q \u2009+\u2009. Soochow J. Math.\u00a020, 535\u2013546 (1994)","journal-title":"Soochow J. Math."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02737-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T20:58:49Z","timestamp":1685048329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}