{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T09:40:13Z","timestamp":1685958013842},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,2]]},"abstract":"<jats:p>In this paper we prove that it is decidable whether the set pow (L), which we get by taking all the powers of all the words in some regular language L, is regular or not. The problem was originally posed by Calbrix and Nivat in 1995. Partial solutions have been given by Cachat for unary languages and by Horv\u00e1th et al. for various kinds of exponent sets for the powers and regular languages which have primitive roots satisfying certain properties. We show that the regular languages which have a regular power are the ones which are 'almost' equal to their Kleene-closure.<\/jats:p>","DOI":"10.1142\/s0129054111008064","type":"journal-article","created":{"date-parts":[[2011,2,21]],"date-time":"2011-02-21T10:13:46Z","timestamp":1298283226000},"page":"323-330","source":"Crossref","is-referenced-by-count":1,"title":["POWERS OF REGULAR LANGUAGES"],"prefix":"10.1142","volume":"22","author":[{"given":"SZIL\u00c1RD ZSOLT","family":"FAZEKAS","sequence":"first","affiliation":[{"name":"Faculty of Natural Sciences, University College of Ny\u00edregyh\u00e1za, S\u00f3st\u00f3i \u00fat 31\/B, Ny\u00edregyh\u00e1za, 4400, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46011-X_11"},{"key":"rf3","unstructured":"H.\u00a0Calbrix and M.\u00a0Nivat, Prefix and Period Languages of Rational omega-Languages, Developments in Language Theory 1995, eds. J.\u00a0Dassow, G.\u00a0Rozenberg and A.\u00a0Salomaa (World Scientific, 1996)\u00a0pp. 341\u2013349."},{"key":"rf4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.5486\/PMD.2004.2775","volume":"64","author":"D\u00f6m\u00f6si P.","journal-title":"Publ. Math. Debrecen"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46011-X_23"},{"key":"rf7","first-page":"289","volume":"9","author":"Lyndon R. C.","journal-title":"Michigan Math. Journ."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"rf9","first-page":"535546","volume":"20","author":"Shyr H. J.","journal-title":"Soochow J. Math."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111008064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T09:10:23Z","timestamp":1685956223000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111008064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":7,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,2]]}},"alternative-id":["10.1142\/S0129054111008064"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111008064","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}