The Expressibility of Languages and Relations by Word Equations

Authors:
Juhani Karhumäki;Wojciech Plandowski;Filippo Mignosi
Affiliations:
-;-;-
Venue:
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Year:
1997

Satisfiability of word equations with constants is in NEXPTIME

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The expressibility of languages and relations by word equations

Journal of the ACM (JACM)
Two-Variable Word Equations

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms on Compressed Strings and Arrays

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Subwords and Power-Free Words are not Expressible by Word Equations

Fundamenta Informaticae

Hi-index	0.01