✦ LIBER ✦

(Semi)alternating stack automata

✍ Scribed by Eitan M. Gurari; Oscar H. Ibarra

Book ID: 105308987
Publisher: Springer
Year: 1981
Tongue: English
Weight: 1006 KB
Volume: 15
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01786980

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Tree-stack automata

✍ W. Golubski, W. M. Lippe 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 951 KB

Alternating tree automata

✍ Giora Slutzki 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 816 KB

R70-2 Nested Stack Automata

✍ Hopcroft, J.E. 📂 Article 📅 1970 🏛 IEEE 🌐 English ⚖ 194 KB

On alternating ω-automata

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

Remarks on multihead pushdown automata a

Remarks on multihead pushdown automata and multihead stack automata

✍ Satoru Miyano 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 660 KB