| |
| 2006 | ||
|---|---|---|
| 3 | EE | Sebastian Bala: Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms. Theory Comput. Syst. 39(1): 137-163 (2006) |
| 2004 | ||
| 2 | EE | Sebastian Bala: Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms. STACS 2004: 596-607 |
| 2002 | ||
| 1 | EE | Sebastian Bala: Intersection of Regular Languages and Star Hierarchy. ICALP 2002: 159-169 |