Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Constraints in computational logics
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Matching Modulo Associativity and Idempotency Is NP-Complete
MFCS '00 Proceedings of the 25th 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
Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Intersection of Regular Languages and Star Hierarchy
ICALP '02 Proceedings of the 29th 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
Pattern Equations and Equations with Stuttering
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Parallelism and Tree Regular Constraints
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Non-structural subtype entailment in automata theory
Information and Computation - TACS 2001
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
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
Matching Trace Patterns with Regular Policies
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
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
HAMPI: A solver for word equations over strings, regular expressions, and context-free grammars
ACM Transactions on Software Engineering and Methodology (TOSEM)
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 |