✦ LIBER ✦

Set Constraints and Automata

✍ Scribed by Rémi Gilleron; Sophie Tison; Marc Tommasi

Book ID: 112252383
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 327 KB
Volume: 149
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1998.2747

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree automata with one memory set constr

Tree automata with one memory set constraints and cryptographic protocols

✍ Hubert Comon; Véronique Cortier 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Algebraic Constraints, Automata, and Reg

Algebraic Constraints, Automata, and Regular Languages

✍ Bakhadyr Khoussainov 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 840 KB

Set constraints and topology

✍ Franck Seynhaeve 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 82 KB

Set constraints are inclusions between expressions denoting sets of trees. Such expressions are first-order terms with or without set operators. Many results in the literature on set constraints are topological in flavor. In this paper, we notice that the set of solutions of a system of set constrai

Tarskian Set Constraints

✍ Robert Givan; David McAllester; Carl Witty; Dexter Kozen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Arithmetic Meyer sets and finite automat

Arithmetic Meyer sets and finite automata

✍ Shigeki Akiyama; Frédérique Bassino; Christiane Frougny 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Set Constraints and Logic Programming

✍ Dexter Kozen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 601 KB