Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms.

Sebastian Bala Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms. 137-163 2006 39 Theory Comput. Syst. 1 http://dx.doi.org/10.1007/s00224-005-1262-y db/journals/mst/mst39.html#Bala06