✦ LIBER ✦

Automata on Infinite Trees with Counting Constraints

✍ Scribed by D. Beauquier; D. Niwinski

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deciding Emptiness for Stack Automata on

✍ D. Harel; D. Raz 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 810 KB

Tree automata with one memory set constr

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

Tree automata with equality constraints

✍ Florent Jacquemard; Michael Rusinowitch; Laurent Vigneron 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 783 KB

Generalized automata on infinite trees a

✍ A. Saoudi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 871 KB

On matrices, automata, and double counti

✍ Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 847 KB

Decidability of Second-Order Theories an

✍ Michael O. Rabin 📂 Article 📅 1969 🏛 American Mathematical Society 🌐 English ⚖ 862 KB