Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group

DOI10.1016/0304-3975(84)90044-6zbMATH Open0555.20036OpenAlexW2016799182MaRDI QIDQ760506FDOQ760506

Authors: Friedrich Otto 

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90044-6

Recommendations

• Finite complete rewriting systems for groups
• scientific article; zbMATH DE number 2074997
• Geodesic rewriting systems and pregroups
• Complete rewriting system for the Schützenberger product of \(n\) groups
• Remarks on an example of Jantzen

zbMATH Keywords

presentationpolynomial-time algorithmword problemfinite complete rewriting systemGreendlinger groupJantzen monoidKnuth- Bendix ordering

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05)

Cites Work

• Title not available (Why is that?)
• Orderings for term-rewriting systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic simplification
• Title not available (Why is that?)
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Dehn's algorithm for the word problem
• Title not available (Why is that?)
• Confluent and Other Types of Thue Systems
• Testing for the Church-Rosser property
• When is a monoid a group? The Church-Rosser case is tractable
• Title not available (Why is that?)
• The undecidability of the preperfectness of Thue systems
• A note on representations of a certain monoid
• On a special monoid with a single defining relation
• Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Remarks on an example of Jantzen

Cited In (13)

• Thue systems as rewriting systems
• Analysis of Dehn's algorithm by critical pairs
• On groups presented by monadic rewriting systems with generators of finite order.
• Finite complete rewriting systems for regular semigroups.
• Commutativity in groups presented by finite Church-Rosser Thue systems
• Finite complete rewriting systems for groups
• A note on a special one-rule semi-Thue system
• Finite complete rewriting systems and the complexity of word problem
• Complete rewriting system for the Schützenberger product of \(n\) groups
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Remarks on an example of Jantzen
• The word problem for one-relation monoids: a survey
• About the descriptive power of certain classes of finite string-rewriting systems

This page was built for publication: Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760506)