The following pages link to STACS 2004 (Q5309734):
Displaying 4 items.
- Language equations with complementation: decision problems (Q880178) (← links)
- Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms (Q2432531) (← links)
- An Evaluation of Automata Algorithms for String Analysis (Q3075486) (← links)
- Distance desert automata and the star height problem (Q5313718) (← links)