Minimal and complete word unification
Journal of the ACM (JACM)
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
Makanin's algorithm is not primitive recursive
Theoretical Computer Science
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)
Application of Lempel-Ziv Encodings to the Solution of Words Equations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization
IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
The Security of Individual RSA Bits
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding patterns common to a set of strings (Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
A word equation solver based on Levensthein distance
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
HAMPI: A solver for word equations over strings, regular expressions, and context-free grammars
ACM Transactions on Software Engineering and Methodology (TOSEM)
Z3-str: a z3-based string solver for web application analysis
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Word equations with length constraints: what's decidable?
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Theory of Computing Systems
| Hi-index | 0.00 |
We present the first DEXPTIME algorithm which solves word equations i.e. finds a finite representation of all solutions of an equation in a free semigroup. We show how to use our approach to solve two new problems in PSPACE which deal with properties of the solution set of a word equation:deciding finiteness of the solution set,deciding boundness of the set of maximal exponents of periodicity of solutions. The approach can be generalized to solve in PSPACE three problems for expressible relations, namely the emptiness of the relation, finiteness of the relation and boundness of the set of maximal exponents of periodicity of elements of the relation.