Author:
Mateescu Alexandru,Salomaa Arto
Subject
Computer Science Applications,General Mathematics,Software
Reference5 articles.
1. 1. CULIK II K. and SALOMAA A., Test Sets and Checking Words for Homomorphism Equivalence, J. Comput. System Sci., 1980, 20, pp. 379-395.5848660451.68046
2. 2. LYNDON R. C. and SCHUTZENBERGER M. P., The Equation aM = bN cP in Free Group, Michigan Math. J. 1962, 9, pp. 289-298.1628380106.02204
3. 3. POST E., A Variant of a Recursively Unsolvable Problem, Bull. Amer. Math. Soc., 1946, 52, pp. 264-268.153430063.06329
4. 4. SALOMAA A., Jewels of Formal Language Theory, Comput. Sci. Press, 1981.6181240487.68064
5. 5. SALOMAA A., SALOMAA K. and YU SHENG, Primality types of instances of the Post Correspondent Problem, E.A.T.C.S. Bulletin, 1991, 44.0744.68083
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Discontinuity in Pattern Inference;Lecture Notes in Computer Science;2004
2. Morphisms;Handbook of Formal Languages;1997
3. Flatwords and Post Correspondence Problem;Theoretical Computer Science;1996-07
4. Strongly prime PCP words;Discrete Applied Mathematics;1995-11
5. P, NP, and the Post Correspondence Problem;Information and Computation;1995-09