Using string-rewriting for solving the word problem for finitely presented groups
type: Item
instance of: scholarly article
title: Using string-rewriting for solving the word problem for finitely presented groups
zbMATH Open document ID: 0626.20025
DOI: 10.1016/0020-0190(87)90149-9
author: Klaus Madlener
author: Friedrich Otto
published in: Information Processing Letters
publication date: 1987-01-01T00:00:00Z
review text: It is shown that the word problem for the group \(<\{a,b\}\), \(abba=1>\) can be solved through the technique of string-rewriting. The time complexity of the algorithm is given.
reviewed by: M.Pałasiński
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 20M35
zbMATH DE Number: 4017172
zbMATH Keywords: monoid presentation
zbMATH Keywords: word problem
zbMATH Keywords: string-rewriting
zbMATH Keywords: complexity
zbMATH Keywords: algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(87)90149-9
OpenAlex ID: W2056285149
cites work: Confluent and Other Types of Thue Systems
cites work: Q3677188
cites work: Q3714064
cites work: A note on a special one-rule semi-Thue system
cites work: Q4430312
cites work: A finite Thue system with decidable word problem and without equivalent finite canonical system
cites work: On deciding whether a monoid is a free monoid or is a group
cites work: On deciding the confluence of a finite string-rewriting system on a given congruence class
description: scientific article; zbMATH DE number 4017172