Compressed Word Problems in HNN-Extensions and Amalgamated Products

Authors:
Niko Haubold;Markus Lohrey
Affiliations:
Institut für Informatik, Universität Leipzig,;Institut für Informatik, Universität Leipzig,
Venue:
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Year:
2009

Citing 5
Cited 0

Complexity of Language Recognition Problems for Compressed Words

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Testing Equivalence of Morphisms on Context-Free Languages

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Word Problems and Membership Problems on Compressed Words

SIAM Journal on Computing
Theories of HNN-Extensions and amalgamated products

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Efficient computation in groups via compression

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the compressed word problem for an HNN-extension ***H , t |t *** 1 a t = φ (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.