The word problem for free partially commutative groups
Journal of Symbolic Computation
Combinatorics on traces
Word problems over the traces which are solvable in linear time
IDTC Second international conference on Database theory
Finite Monoids: From Word to Circuit Evaluation
SIAM Journal on Computing
Word Problems Solvable in Logspace
Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM (JACM)
The Book of Traces
Word Processing in Groups
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Complexity of Language Recognition Problems for Compressed Words
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
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
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Compressed Word Problems in HNN-Extensions and Amalgamated Products
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Compressed conjugacy and the word problem for outer automorphism groups of graph groups
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Compressed membership in automata with compressed labels
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Compressedword problems for inverse monoids
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
We study the compressed word problem: a variant of the word problem for finitely generated groups where the input word is given by a context-free grammar that generates exactly one string. We show that finite extensions and free products preserve the complexity of the compressed word problem. Also, the compressed word problem for a graph group can be solved in polynomial time. These results allow us to obtain new upper complexity bounds for the word problem for certain automorphism groups and group extensions.