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
topReferences
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