scientific article; zbMATH DE number 3941518
From MaRDI portal
Publication:3714064
zbMATH Open0587.03026MaRDI QIDQ3714064FDOQ3714064
Authors: Ronald V. Book
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
complexitydecidabilitymonoid presentationChurch-Rosser propertyalgebraic properties of monoidsreduction relation based on the length
Thue and Post systems, etc. (03D03) Abstract data types; algebraic specification (68Q65) Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)
Cited In (13)
- Thue systems as rewriting systems
- Calcul de longueurs de chaînes de réécriture dans le monoïde libre
- Buchberger's algorithm: The term rewriter's point of view
- Commutativity in groups presented by finite Church-Rosser Thue systems
- Groups and NTS languages
- Using string-rewriting for solving the word problem for finitely presented groups
- On finite commutative Thue systems
- On deciding whether a monoid is a free monoid or is a group
- Unification theory
- On the Noetherian properties of reduction system of words
- History and basic features of the critical-pair/completion procedure
- Conditional semi-Thue systems for presenting monoids
- Divergence phenomena during completion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714064)