Dehn's Algorithm and the Complexity of Word Problems (Q3826535)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4101159
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dehn's Algorithm and the Complexity of Word Problems |
scientific article; zbMATH DE number 4101159 |
Statements
Dehn's Algorithm and the Complexity of Word Problems (English)
0 references
1988
0 references
finite Thue system
0 references
rewriting system
0 references
linear-time algorithm
0 references
0.8791553378105164
0 references
0.8184617161750793
0 references
0.814426839351654
0 references
0.8093475699424744
0 references
0.8093475699424744
0 references
Let T be a finite Thue system over the alphabet \(\Sigma\) such that T has no rules that preserve length, and let R be the rewriting system defined by \(R=\{(u,v)\in T\) or (v,u)\(\in T\), and \(| u| >| v| \}\). Thus the notion of reduction generated by R is based on decreasing the length of the string by applying a rewriting rule. For a string \(z\in \Sigma\), T is Church-Rosser on the congruence class [z] if [z] contains at most one irreducible element. The author proves that if the monoid presented by T is a group, and if T is Church-Rosser on some congruence class [z], then there is a linear- time algorithm to solve the word problem for this group. As a corollary of this theorem one has the result obtained by Domanski and Anshel: If G is a finitely presented group such that Dehn's algorithm solves the word problem for G, then there is a linear-time algorithm to solve the word problem for G.
0 references