✦ LIBER ✦

The complexity of tree automata and XPath on grammar-compressed trees

✍ Scribed by Markus Lohrey; Sebastian Maneth

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameter reduction and automata evaluat

✍ Markus Lohrey; Sebastian Maneth; Manfred Schmidt-Schauß 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 355 KB

The Complexity of Tree Automata and Logi

✍ Emerson, E. Allen; Jutla, Charanjit S. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 519 KB

The Equivalence of Tree Adjoining Gramma

✍ Stephan Kepser; Jim Rogers 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 430 KB

On the power of tree-walking automata

✍ Frank Neven; Thomas Schwentick 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Alternating automata, the weak monadic t

✍ David E. Muller; Ahmed Saoudi; Paul E. Schupp 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 882 KB

On the generative capacity of tree contr

✍ Gh. Paun 📂 Article 📅 1979 🏛 Springer Vienna 🌐 English ⚖ 358 KB