On the Square Root of Languages

The unambiguous square root of a language L ⫃ Σ* is a language X s.t. X 2 = L and the product is unambiguous. We prove that: 1. Every language admits at most one unambiguous square root 2. For the class of regular languages, it is decidable whether the unambiguous square root is regular; the same problem becomes undecidable for the class of context-free languages 3. The unambiguous square root of a language in P is in P

[1]  J. Shepherdson,et al.  Computer programming and formal systems , 1965 .

[2]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[3]  Noam Chomsky,et al.  The Algebraic Theory of Context-Free Languages* , 1963 .

[4]  Michel Latteux,et al.  Motifs Et Bases De Langages , 1989, RAIRO Theor. Informatics Appl..

[5]  Bodonirina Ratoandromanana,et al.  Codes Et Motifs , 1989, RAIRO Theor. Informatics Appl..

[6]  Ernst L. Leiss,et al.  On Equations for Regular Languages, Finite Automata, and Sequential Networks , 1980, Theor. Comput. Sci..

[7]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[8]  Antonio Restivo,et al.  Some Decision Results for Recognizable Sets in Arbitrary Monoids , 1978, ICALP.

[9]  Arto Salomaa,et al.  Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.