Abstract
In this paper we study the satisfiability problem for language equations and constraints between regular open terms. We prove that: the constraint problem is PSPACE-complete, the regular language matching problem is EXPSPACE-complete even if we ask about satisfiability by regular languages, satisfiability of word-like language equations is in PSPACE, the finite solution problem is EXPSPACE-complete.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
