论文信息 - When is a Monoid a Group? The Church-Rosser Case is Tractable

When is a Monoid a Group? The Church-Rosser Case is Tractable

Abstract The following question is shown to be tractable: given a finite monadic Church-Rosser Thue system T and a finite set A , is the submonoid generated by A (of the monoid presented by T ) a group?

Ronald V. Book

[1] Matthias Jantzen. On a Special Monoid with a Single Defining Relation , 1981, Theor. Comput. Sci..

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

[3] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[4] Y. Cochet,et al. Une Generalisation des Ensembles de Dyck , 1971 .

[5] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[6] Colm Ó'Dúnlaing,et al. Testing for the Church-Rosser Property , 1981, Theor. Comput. Sci..

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

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

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

[10] Colm Ó'Dúnlaing. Finite and infinite regular thue systems , 1981 .

[11] Maurice Nivat. On some families of languages related to the Dyck language , 1970, STOC '70.

[12] Neil D. Jones,et al. Complete problems for deterministic polynomial time , 1974, Symposium on the Theory of Computing.