Compressed conjugacy and the word problem for outer automorphism groups of graph groups

Authors:
Niko Haubold;Markus Lohrey;Christian Mathissen
Affiliations:
Institut für Informatik, Universität Leipzig, Germany;Institut für Informatik, Universität Leipzig, Germany;Institut für Informatik, Universität Leipzig, Germany
Venue:
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Year:
2010

Citing 9
Cited 0

The word problem for free partially commutative groups

Journal of Symbolic Computation
Efficient solution of some problems in free partially commutative monoids

Information and Computation
Combinatorics on traces

Combinatorics on traces
Asynchronous mappings and asynchronous cellular automata

Information and Computation
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Testing Equivalence of Morphisms on Context-Free Languages

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Pattern Matching and Membership for Hierarchical Message Sequence Charts

Theory of Computing Systems
Efficient computation in groups via compression

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Processing compressed texts: a tractability border

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed form. As a consequence it follows that the word problem for the outer automorphism group of a graph group can be solved in polynomial time.