The following pages link to Computer Science Logic (Q5311277):
Displaying 5 items.
- Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms (Q2432531) (← links)
- Multiple constraints on three and four words (Q2474221) (← links)
- Set constraints in some equational theories (Q5096315) (← links)
- STACS 2004 (Q5309734) (← links)
- Deciding inclusion of set constants over infinite non-strict data structures (Q5441550) (← links)