论文信息 - The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable - 字舞流文

The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable

Andrzej Ehrenfeucht | Grzegorz Rozenberg | Juhani Karhumäki | A. Ehrenfeucht | G. Rozenberg | J. Karhumäki

[1] Franz-Josef Brandenburg,et al. Equality Sets and Complexity Classes , 1980, SIAM J. Comput..

[2] Joost Engelfriet,et al. Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.

[3] Karel Culik,et al. On the Equality Sets for Homomorphisms on Free Monoids with Two Generators , 1980, RAIRO Theor. Informatics Appl..

[4] Karel Culik. A Purely Homomorphic Characterization of Recursively Enumerable Sets , 1979, JACM.

[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[6] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[7] Arto Salomaa. Equality sets for homomorphisms of free monoids , 1978, Acta Cybern..

[8] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[9] Emil L. Post. A variant of a recursively unsolvable problem , 1946 .