✦ LIBER ✦

Tree automata with equality constraints modulo equational theories

✍ Scribed by Florent Jacquemard; Michael Rusinowitch; Laurent Vigneron

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tree Automata Help One To Solve Equation

✍ D. Lugiez; J.L. Moysset 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Automata on Infinite Trees with Counting

✍ D. Beauquier; D. Niwinski 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 806 KB

Solving constraint satisfaction problems

✍ Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 541 KB

Tree automata with one memory set constr

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

Emptiness and Finiteness for Tree Automa

✍ Creus, Carles; Gascón, Adrià; Godoy, Guillem 📂 Article 📅 2012 🏛 Springer Netherlands 🌐 English ⚖ 586 KB

Optimization of systems governed by hype

✍ M. A. Kazemi-Dehkordi 📂 Article 📅 1985 🏛 Springer Milan 🌐 Italian ⚖ 589 KB