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

Sebastian Bala

Browse the full STACS paper archive.