Set constraints and automata
From MaRDI portal
Publication:1286366
DOI10.1006/INCO.1998.2747zbMATH Open0928.68065OpenAlexW1977793919MaRDI QIDQ1286366FDOQ1286366
M. Tommasi, Sophie Tison, Rémi Gilleron
Publication date: 12 January 2000
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/adaa7909a51ed9431300ed8c39f57f7bab31bb4f
Recommendations
Cites Work
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of systems of set constraints with negative constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rational spaces and set constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Grid structures and undecidable constraint theories
- Some new decidability results on positive and negative set constraints
Cited In (9)
- Encompassment properties and automata with constraints
- Decidability of systems of set constraints with negative constraints
- Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs.
- Calculi in which derivability is decidable by finite interpretations
- Closure properties and decision problems of dag automata
- Grid structures and undecidable constraint theories
- Tree tuple languages from the logic programming point of view
- The HOM Problem is EXPTIME-Complete
- Unification modulo ACUI plus distributivity axioms
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)
