no. 1
PCP-prime words and primality types
RAIRO. Informatique théorique et applications, Tome 27 (1993) no. 1, pp. 57-70 
@article{ITA_1993__27_1_57_0,
     author = {Mateescu, Alexandru and Salomaa, Arto},
     title = {PCP-prime words and primality types},
     journal = {RAIRO. Informatique th\'eorique et applications},
     pages = {57--70},
     year = {1993},
     publisher = {EDP-Sciences},
     volume = {27},
     number = {1},
     mrnumber = {1213421},
     zbl = {0770.68082},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1993__27_1_57_0/}
}
TY  - JOUR
AU  - Mateescu, Alexandru
AU  - Salomaa, Arto
TI  - PCP-prime words and primality types
JO  - RAIRO. Informatique théorique et applications
PY  - 1993
SP  - 57
EP  - 70
VL  - 27
IS  - 1
PB  - EDP-Sciences
UR  - https://www.numdam.org/item/ITA_1993__27_1_57_0/
LA  - en
ID  - ITA_1993__27_1_57_0
ER  - 
%0 Journal Article
%A Mateescu, Alexandru
%A Salomaa, Arto
%T PCP-prime words and primality types
%J RAIRO. Informatique théorique et applications
%D 1993
%P 57-70
%V 27
%N 1
%I EDP-Sciences
%U https://www.numdam.org/item/ITA_1993__27_1_57_0/
%G en
%F ITA_1993__27_1_57_0
Mateescu, Alexandru; Salomaa, Arto. PCP-prime words and primality types. RAIRO. Informatique théorique et applications, Tome 27 (1993) no. 1, pp. 57-70. https://www.numdam.org/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. | Zbl | MR

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

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

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

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