Flatwords and Post Correspondence Problem

Theoretical Computer Science

Volumn 161, Issue 1-2, 1996, Pages 93-108

  Harju, Tero ^a   Lipponen, Marjo ^a   Mateescu, Alexandru ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SET THEORY;

ALPHABET; FLATWORDS; LATIN PRODUCT; OPEN PROBLEM; POST CORRESPONDENCE PROBLEM; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 0030182578     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00092-5     Document Type: Article

References (20)

1. T. Axford, Concurrent Programming Fundamental Techniques for Real-Time and Parallel Software Design (Wiley, New York, 1989).
2. R. V. Book and F.J. Brandenburg, Representing complexity classes by equality sets, Lecture Notes in Computer Science, Vol. 71 (Springer, Berlin, 1979), 49-57.
3. R.V. Book and F.J. Brandenburg, Equality sets and complexity classes, SIAM J. Comput. 9 (1980) 729-743.
4. V. Claus, Some remarks on PCP(k) and related problems, EATCS Bull., 12 (1980) 54-61.
5. S. Eilenberg, Automata, Languages, and Machines, Vol. A (Academic Press, New York, 1974).
6. J.S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science (Longman, New York 1992).
7. J.S. Golan, A. Mateescu and D. Vaida, Towards a unified theory of sequential, parallel and semi-parallel processes, submitted.
8. M. Gondram and M. Minoux, Graphs and Algorithms (Wiley-interscience, New York 1984).
9. A. Ehrenfeucht, J. Karhumäki and G. Rozenberg, The (generalized) Post Correspondence Problem with lists consisting of two words is decidable, Theoret. Comput. Sci. 21 (1982) 119-144.
10. J. Karhumäki, On recent trends in formal language theory, in: T. Ottmann, ed., Proc. 14th ICALP, 1987, Lecture Notes in Computer Science, Vol. 267 (Springer, Berlin, 1987) 138-162.
11. M. Lipponen, Primitive Words and Languages Associated to PCP, EATCS Bull. 53 (1994) 217-226.
12. M. Lipponen, Post Correspondence Problem: words possible as primitive solutions, in: Proc. ICALP-95, (Springer, Berlin), to appear.
13. M. Lipponen, On F-prime solutions of the Post Correspondence Problem, in: Proc. 2nd Internat. Conf. on Developments in Language Theory, Magdeburg, 1995, to appear.
14. M. Lipponen and Gh. Pǎun, Strongly prime PCP words, Discrete Appl. Math., to appear.
15. A. Mateescu and A. Salomaa, PCP-prime words and primality types, RAIRO Inform. Théorique 27 (1993) 57-70.
16. A. Mateescu and A. Salomaa, On simplest possible solutions for Post Correspondence Problems, Acta Inform. 30 (1993) 441-457.
17. A. Mateescu, A. Salomaa, K. Salomaa and S. Yu, P, NP and Post Correspondence Problem, Inform. and Comput., to appear.
18. J.J. Pansiot, A note on Post's Correspondence Problem, Inform. Proc. Lett. 12 (1981) 233.
19. E. Post, A variant of a recursively unsolvable problem, Bull. Amer. Math. Soc. 53 (1946) 264-268.
20. A. Salomaa, K. Salomaa and S. Yu, Primality types of instances of the Post Correspondence Problem, EATCS Bull. 44 (1991) 226-241.