Skip to Main content Skip to Navigation
Journal articles

Set constraints and automata

Abstract : We define a new class of automata which is an acceptor model for mappings from the set of terms T? over a ranked alphabet ? into a set E of labels. When E is a set of tuples of binary values, an automaton can be viewed as an acceptor model for n-tuples of tree languages. We prove decidability of emptiness and closure properties for this class of automata. As a consequence of these results, we prove decidability of satisfiability of systems of positive and negative set constraints without projection symbols. We prove the decidability of the satisfiability problem for systems of positive and negative set constraints without projection symbols. Moreover we prove that a non-empty set of solutions always contain a regular solution (i.e., a n-tuple of regular tree languages). We also deduce decidability results for properties of sets of solutions of systems of set constraints.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00538886
Contributor : Rémi Gilleron <>
Submitted on : Tuesday, November 23, 2010 - 2:48:41 PM
Last modification on : Tuesday, April 28, 2020 - 11:52:08 AM

Identifiers

  • HAL Id : inria-00538886, version 1

Collections

Citation

Rémi Gilleron, Sophie Tison, Marc Tommasi. Set constraints and automata. Information and Computation, Elsevier, 1999, 149 (1), pp.1--41. ⟨inria-00538886⟩

Share

Metrics

Record views

186