Set constraints and automata

DOI10.1006/INCO.1998.2747zbMath0928.68065OpenAlexW1977793919MaRDI QIDQ1286366

Marc 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

zbMATH Keywords

set constraintstree languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

Tree tuple languages from the logic programming point of view ⋮ Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs. ⋮ Grid structures and undecidable constraint theories ⋮ Unification modulo ACUI plus distributivity axioms ⋮ The HOM Problem is EXPTIME-Complete ⋮ Closure properties and decision problems of dag automata

Cites Work

• Decidability of systems of set constraints with negative constraints
• Some new decidability results on positive and negative set constraints
• Rational spaces and set constraints
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Grid structures and undecidable constraint theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Set constraints and automata