The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science - Implementation and application of automata
Unification with Singleton Tree Grammars
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
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
Unification and matching on compressed terms
ACM Transactions on Computational Logic (TOCL)
Leaf languages and string compression
Information and Computation
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
Congruence closure of compressed terms in polynomial time
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Automata for positive core XPath queries on compressed documents
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Context-Free grammars and XML languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Some decision problems concerning NPDAs, palindromes, and dyck languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
We consider a compressed form of the word problem for finitely presented monoids, where the input consists of two compressed representations of words over the generators of a monoid M, and we ask whether these two words represent the same monoid element of M. Words are compressed using straight-line programs, i.e., context-free grammars that generate exactly one word. For several classes of finitely presented monoids we obtain completeness results for complexity classes in the range from P to EXPSPACE. As a by-product of our results on compressed word problems we obtain a fixed deterministic context-free language with a PSPACE-complete compressed membership problem. The existence of such a language was open so far. Finally, we will investigate the complexity of the compressed membership problem for various circuit complexity classes.