Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
type: Item
instance of: scholarly article
title: Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
zbMATH Open document ID: 0555.20036
DOI: 10.1016/0304-3975(84)90044-6
author: Friedrich Otto
published in: Theoretical Computer Science
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 20F05
zbMATH DE Number: 3884389
zbMATH Keywords: presentation
zbMATH Keywords: Jantzen monoid
zbMATH Keywords: finite complete rewriting system
zbMATH Keywords: Knuth- Bendix ordering
zbMATH Keywords: Greendlinger group
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: word problem
MaRDI profile type: Publication
full work available at URL: 0304-3975(84)90044-6
OpenAlex ID: W2016799182
cites work: Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
cites work: Q3329652
cites work: Testing for the Church-Rosser property
cites work: Confluent and Other Types of Thue Systems
cites work: When is a monoid a group? The Church-Rosser case is tractable
cites work: Q3319766
cites work: Algebraic simplification
cites work: Orderings for term-rewriting systems
cites work: Dehn's algorithm for the word problem
cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
cites work: On a special monoid with a single defining relation
cites work: Q3756512
cites work: Q5581665
cites work: Q3853827
cites work: Q3664414
cites work: Q4145882
cites work: Q4135772
cites work: The undecidability of the preperfectness of Thue systems
cites work: Q4105657
cites work: Remarks on an example of Jantzen
cites work: A note on representations of a certain monoid
description: scientific article; zbMATH DE number 3884389