676 research outputs found
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
It is known that the existential theory of equations in free groups is
decidable. This is a famous result of Makanin. On the other hand it has been
shown that the scheme of his algorithm is not primitive recursive. In this
paper we present an algorithm that works in polynomial space, even in the more
general setting where each variable has a rational constraint, that is, the
solution has to respect a specification given by a regular word language. Our
main result states that the existential theory of equations in free groups with
rational constraints is PSPACE-complete. We obtain this result as a corollary
of the corresponding statement about free monoids with involution.Comment: 45 pages. LaTeX sourc
Non-covalent interactions at electrochemical interfaces : one model fits all?
Acknowledgements Funding from the DGI (Spanish Ministry of Education and Science) through Project CTQ2009-07017 is gratefully acknowledged. E.P.M.L. wishes to thank the Universidad Nacional de Co´rdoba, Argentina, for a grant within the ‘‘Programa de Movilidad Internacional de Profesores Cuarto Centenario’’.Peer reviewedPublisher PD
- …