scientific article
From MaRDI portal
Publication:3026992
zbMath0625.03023MaRDI QIDQ3026992
Craig C. Squier, Friedrich Otto
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items (9)
A finiteness condition for rewriting systems ⋮ A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) ⋮ Ends for subsemigroups of finite index. ⋮ Complexity, combinatorial group theory and the language of palutators ⋮ Church-Rooser property and homology of monoids ⋮ Complete rewriting systems and homology of monoid algebras ⋮ A decidable word problem without equivalent canonical term rewriting system ⋮ A finitely presented monoid which has solvable word problem but has no regular complete presentation ⋮ A rewriting coherence theorem with applications in homotopy type theory
This page was built for publication:
