Recommendations
Cites work
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 177848 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1555173 (Why is no real title available?)
- scientific article; zbMATH DE number 1555185 (Why is no real title available?)
- scientific article; zbMATH DE number 2102743 (Why is no real title available?)
- scientific article; zbMATH DE number 3303661 (Why is no real title available?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decidability of systems of set constraints with negative constraints
- Grid structures and undecidable constraint theories
- Rational spaces and set constraints
- Some new decidability results on positive and negative set constraints
Cited in
(9)- Tree tuple languages from the logic programming point of view
- Closure properties and decision problems of dag automata
- Manipulating tree tuple languages by transforming logic programs
- Calculi in which derivability is decidable by finite interpretations
- Decidability of systems of set constraints with negative constraints
- The HOM problem is EXPTIME-complete
- Unification modulo ACUI plus distributivity axioms
- Grid structures and undecidable constraint theories
- Encompassment properties and automata with constraints
This page was built for publication: Set constraints and automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1286366)