PCP-prime words and primality types
Mateescu, Alexandru ; Salomaa, Arto
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993), p. 57-70 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1993-01-01
@article{ITA_1993__27_1_57_0,
     author = {Mateescu, Alexandru and Salomaa, Arto},
     title = {PCP-prime words and primality types},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {27},
     year = {1993},
     pages = {57-70},
     mrnumber = {1213421},
     zbl = {0770.68082},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1993__27_1_57_0}
}

Mateescu, Alexandru; Salomaa, Arto. PCP-prime words and primality types. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) pp. 57-70. http://gdmltest.u-ga.fr/item/ITA_1993__27_1_57_0/

1. K. Culik Ii and A. Salomaa, Test Sets and Checking Words for Homomorphism Equivalence, J. Comput. System Sci., 1980, 20, pp. 379-395. | MR 584866 | Zbl 0451.68046

2. R. C. Lyndon and M. P. Schutzenberger, The Equation aM = bN cP in Free Group, Michigan Math. J. 1962, 9, pp. 289-298. | MR 162838 | Zbl 0106.02204

3. E. Post, A Variant of a Recursively Unsolvable Problem, Bull. Amer. Math. Soc., 1946, 52, pp. 264-268. | MR 15343 | Zbl 0063.06329

4. A. Salomaa, Jewels of Formal Language Theory, Comput. Sci. Press, 1981. | MR 618124 | Zbl 0487.68064

5. A. Salomaa, K. Salomaa and Sheng Yu, Primality types of instances of the Post Correspondent Problem, E.A.T.C.S. Bulletin, 1991, 44. | Zbl 0744.68083