✦ LIBER ✦

Deciding Emptiness for Stack Automata on Infinite Trees

✍ Scribed by D. Harel; D. Raz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decidability of Second-Order Theories an

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

On pebble automata for data languages wi

✍ Tony Tan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 235 KB

Automata on Infinite Trees with Counting

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

Generalized automata on infinite trees a

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

Stack versus sensitivity for one-way aut

✍ Mirosław Kutyłowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 831 KB

Systolic automata for VLSI on balanced t

✍ K. Culik; J. Gruska; A. Salomaa 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 515 KB