Computing presentations for subgroups of polycyclic groups and of context-free groups (Q1328439): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:43, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing presentations for subgroups of polycyclic groups and of context-free groups |
scientific article |
Statements
Computing presentations for subgroups of polycyclic groups and of context-free groups (English)
0 references
29 August 1994
0 references
prefix-rewriting systems
0 references
finitely generated context-free groups
0 references
\(\lambda\)-confluent string-rewriting systems
0 references
decision problems
0 references
finitely generated subgroups
0 references
presentations
0 references
finitely presented polycyclic groups
0 references
finite confluent PCP2-presentations
0 references
