• Citer

Unary prime languages

par Jecker, Ismaël Robin ;Kupferman, Orna;Mazzocchi, Nicolas
Référence Leibniz international proceedings in informatics, 170, MFCS-2020-51
Publication Publié, 2020-08

Article révisé par les pairs

• Détails
• Contenu

Résumé :

A regular language L of finite words is composite if there are regular languages L1, L2, . . ., Lt such that L = Tti=1 Li and the index (number of states in a minimal DFA) of every language Li is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [9], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of N, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L's, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs.