✦ LIBER ✦

Alternating tree automata

✍ Scribed by Giora Slutzki

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 816 KB
Volume: 41
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90077-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On alternating ω-automata

✍ Peter A. Lindsay 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 456 KB

Alternating and empty alternating auxili

Alternating and empty alternating auxiliary stack automata

✍ Markus Holzer; Pierre McKenzie 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 496 KB

We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new characterizations of NP, the polynomial hierarchy, PSpace, and bounded query classes like co-DP =NL NP

Alternating automata, the weak monadic t

Alternating automata, the weak monadic theory of trees and its complexity

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

Alternating automata with start formulas

✍ A.W. Mostowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 320 KB

On two-way tree automata

✍ Etsuro Moriya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Alternation on cellular automata

✍ Martín Matamala 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 819 KB