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
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
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Satisfiability of equations in free groups is in PSPACE
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Equational theory of context unification is undecidable
Theoretical Computer Science
On Word Equations in One Variable
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Non-structural Subtype Entailment in Automata Theory
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Existential and Positive Theories of Equations in Graph Products
STACS '02 Proceedings of the 19th 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
Currying Second-Order Unification Problems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Stratified Context Unification Is in PSPACE
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Combinatorial and Computational Problems on Finite Sets of Words
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Complexity of Decidable Cases of Commutation Problem for Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Equations in free semigroups with involution and their relation to equations in free groups
Theoretical Computer Science - Latin American theoretical informatics
Non-structural subtype entailment in automata theory
Information and Computation - TACS 2001
Decidability of bounded second order unification
Information and Computation
The non-parametrizability of the word equation xyz=zvx: a short proof
Theoretical Computer Science - Mathematical foundations of computer science 2004
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
An efficient algorithm for solving word equations
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Dynamic test input generation for web applications
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Matching Trace Patterns with Regular Policies
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
Theoretical Computer Science
On the relation between Context and Sequence Unification
Journal of Symbolic Computation
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Decidability of bounded higher-order unification
Journal of Symbolic Computation
A remark about quadratic trace equations
DLT'02 Proceedings of the 6th 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
Sequence unification through currying
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
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
Systems of equations satisfied in all commutative finite semigroups
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Well-nested context unification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Solving equations on words through boolean satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Word equations with length constraints: what's decidable?
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
We prove that satisfiability problem for word equations is in PSPACE improving previous NEXPTIME bound.