论文信息 - Conjugacy in monoids with a special Church-Rosser presentation is decidable - 字舞流文

Conjugacy in monoids with a special Church-Rosser presentation is decidable

Friedrich Otto | F. Otto

[1] G. Lallement. Semigroups and combinatorial applications , 1979 .

[2] Ronald V. Book. Decidable Sentences of Church-Rosser Congruences , 1983, Theor. Comput. Sci..

[3] Ronald V. Book,et al. Confluent and Other Types of Thue Systems , 1982, JACM.

[4] Gerard Lallement,et al. On monoids presented by a single relation , 1974 .

[5] W. W. Boone. Certain simple unsolvable problems of group theory. III , 1955 .

[6] S. Adjan,et al. Defining Relations and Algorithmic Problems for Groups and Semigroups , 1967 .

[7] Donald J. Collins,et al. Recursively enumerable degrees and the conjugacy problem , 1969 .

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

[9] Ronald V. Book,et al. Monadic Thue Systems , 1982, Theor. Comput. Sci..

[10] William W. Boone. MATHEMATICSCertain Simple, Unsolvable Problems of Group Theory. I1) , 1954 .