The following pages link to Set constraints and automata (Q1286366):
Displaying 10 items.
- Tree tuple languages from the logic programming point of view (Q877842) (← links)
- Closure properties and decision problems of dag automata (Q1041757) (← links)
- Calculi in which derivability is decidable by finite interpretations (Q1121677) (← links)
- Unification modulo ACUI plus distributivity axioms (Q1774555) (← links)
- Decidability of systems of set constraints with negative constraints (Q1900313) (← links)
- Generalized definite set constraints (Q1975208) (← links)
- Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs. (Q4916223) (← links)
- Encompassment properties and automata with constraints (Q5055805) (← links)
- The HOM Problem is EXPTIME-Complete (Q5895159) (← links)
- Grid structures and undecidable constraint theories (Q5941204) (← links)
