The many-one equivalence of some general combinatorial decision problems

[1]  Philip K. Hooper.  Monogenic Post Normal Systems of Arbitrary Degree , 1966, JACM.

[2]  Dennis F. Cudia,et al.  Degrees of Unsolvability in Formal Grammars , 1968, J. ACM.

[3]  J. C. Shepherdson,et al.  Machine Configuration and Word Problems of Given Degree of Unsolvability , 1965 .

[4]  Emil L. Post.  Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[5]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[6]  William W. Boone.  Word Problems and Recursively Enumerable Degrees of Unsolvability , 1971 .

[7]  William W. Boone,et al.  Word Problems and Recursively Enumerable Degrees of Unsolvability. A First Paper on Thue Systems , 1966 .

[8]  Ann Yasuhara,et al.  A Remark on Post Normal Systems , 1967, JACM.

[9]  W. E. Singletary,et al.  On deterministic normal systems , 1969 .

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

[11]  Dennis F. Cudia,et al.  The post correspondence problem , 1968, Journal of Symbolic Logic.

[12]  Dag Belsnes,et al.  Decision problems for tag systems , 1971, Journal of Symbolic Logic.

[13]  W. E. Singletary,et al.  The equivalence of some general combinatorial decision problems , 1967 .

[14]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[15]  Emil L. Post.  Formal Reductions of the General Combinatorial Decision Problem , 1943 .