Affiliations: [a] Department of Computer Science, ETH Zürich, Zürich, Switzerland. [email protected], [email protected] | [b] Department of Mathematics and Statistics, University of Turku, Turku, Finland. [email protected]
Correspondence:
[*]
Address for correspondence: CAB F 14, ETH Zürich, Universitätstrasse 6, CH-8092 Zürich, Switzerland.
Note: [†] Research done in part during a stay at ETH Zürich.
Abstract: It is well known that the set of powers of any given order, for example squares, in a regular language need not be regular. Nevertheless, finite automata can identify them via their roots. More precisely, we recall that, given a regular language L, the set of square roots of L is regular. The same holds true for the nth roots for any n and for the set of all nontrivial roots; we give a concrete construction for all of them. Using the above result, we obtain decision algorithms for many natural problems on powers. For example, it is decidable, given two regular languages, whether they contain the same number of squares at each length. Finally, we give an exponential lower bound on the size of automata identifying powers in regular languages. Moreover, we highlight interesting behavior differences between taking fractional powers of regular languages and taking prefixes of a fractional length. Indeed, fractional roots in a regular language can typically not be identified by finite automata.
