Journal of Symbolic Computation
Minimal and complete word unification
Journal of the ACM (JACM)
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
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)
Recognizing string graphs in NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
The Security of Individual RSA Bits
FOCS '98 Proceedings of the 39th 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
On the complexity of decidable cases of the commutation problem of languages
Theoretical Computer Science
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
An Analysis and a Reproof of Hmelevskii's Theorem
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Towards Decidability of Conjugacy of Pairs and Triples
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Decision procedures for algebraic data types with abstractions
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
A symbolic intruder model for hash-collision attacks
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
What's decidable about sequences?
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Theories of HNN-Extensions and amalgamated products
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Deciding functional lists with sublist sets
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
One-Variable word equations in linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.01 |
We prove that satisfiability problem for word equations is in PSPACE.