Complexity of matching problems
Proc. of the first international conference on Rewriting techniques and applications
Journal of Symbolic Computation
Minimal and complete word unification
Journal of the ACM (JACM)
Word unification and transformation of generalized equations
Journal of Automated Reasoning
Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Satisfiability of equations in free groups is in PSPACE
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The expressibility of languages and relations by word equations
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
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
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
Solvability of Context Equations with Two Context Variables is Decidable
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Equations in free semigroups with involution and their relation to equations in free groups
Theoretical Computer Science - Latin American theoretical informatics
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
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
A constraint solver for sequences and its applications
Proceedings of the 2006 ACM symposium on Applied computing
Towards Decidability of Conjugacy of Pairs and Triples
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its 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
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Constraint solving for sequences in software validation and verification
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
| Hi-index | 0.01 |
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a word equation is of order 21.07d, where d is the length of the equation. We also give a lower bound 20.29d so our upper bound is almost optimal and exponentially better than the original bound (6d)22d4+ 2. Consequently, our result implies an exponential improvement of known upper bounds on complexity of word-unification algorithms.