Back to Search
Start Over
Compressed Word Problems in HNN-extensions and Amalgamated Products.
- Source :
-
Theory of Computing Systems . Aug2011, Vol. 49 Issue 2, p283-305. 23p. 8 Diagrams. - Publication Year :
- 2011
-
Abstract
- It is shown that the compressed word problem for an HNN-extension 〈 H, t∣ t at= ϕ( a) ( a∈ A)〉 with A finite is polynomial time Turing-reducible to the compressed word problem for the base group H. An analogous result for amalgamated free products is shown as well. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14324350
- Volume :
- 49
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Theory of Computing Systems
- Publication Type :
- Academic Journal
- Accession number :
- 60903824
- Full Text :
- https://doi.org/10.1007/s00224-010-9295-2