scientific article
From MaRDI portal
Publication:3714064
zbMath0587.03026MaRDI QIDQ3714064
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitydecidabilitymonoid presentationChurch-Rosser propertyalgebraic properties of monoidsreduction relation based on the length
Free semigroups, generators and relations, word problems (20M05) Abstract data types; algebraic specification (68Q65) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items
Divergence phenomena during completion, Buchberger's algorithm: The term rewriter's point of view, History and basic features of the critical-pair/completion procedure, Unification theory, Conditional semi-Thue systems for presenting monoids, Commutativity in groups presented by finite Church-Rosser Thue systems, Using string-rewriting for solving the word problem for finitely presented groups, Groups and NTS languages, On deciding whether a monoid is a free monoid or is a group
