PCP-prime words and primality types
Alexandru Mateescu; Arto Salomaa
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1993)
- Volume: 27, Issue: 1, page 57-70
- ISSN: 0988-3754
Access Full Article
topHow to cite
topMateescu, Alexandru, and Salomaa, Arto. "PCP-prime words and primality types." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 27.1 (1993): 57-70. <http://eudml.org/doc/92438>.
@article{Mateescu1993,
author = {Mateescu, Alexandru, Salomaa, Arto},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Post Correspondence Problem},
language = {eng},
number = {1},
pages = {57-70},
publisher = {EDP-Sciences},
title = {PCP-prime words and primality types},
url = {http://eudml.org/doc/92438},
volume = {27},
year = {1993},
}
TY - JOUR
AU - Mateescu, Alexandru
AU - Salomaa, Arto
TI - PCP-prime words and primality types
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1993
PB - EDP-Sciences
VL - 27
IS - 1
SP - 57
EP - 70
LA - eng
KW - Post Correspondence Problem
UR - http://eudml.org/doc/92438
ER -
References
top- 1. K. CULIK II and A. SALOMAA, Test Sets and Checking Words for Homomorphism Equivalence, J. Comput. System Sci., 1980, 20, pp. 379-395. Zbl0451.68046MR584866
- 2. R. C. LYNDON and M. P. SCHUTZENBERGER, The Equation aM = bN cP in Free Group, Michigan Math. J. 1962, 9, pp. 289-298. Zbl0106.02204MR162838
- 3. E. POST, A Variant of a Recursively Unsolvable Problem, Bull. Amer. Math. Soc., 1946, 52, pp. 264-268. Zbl0063.06329MR15343
- 4. A. SALOMAA, Jewels of Formal Language Theory, Comput. Sci. Press, 1981. Zbl0487.68064MR618124
- 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. Zbl0744.68083
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.