𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On alternating ω-automata

✍ Scribed by Peter A. Lindsay

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
456 KB
Volume
36
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alternating tree automata
Alternating tree automata
✍ Giora Slutzki 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 816 KB
Finite automata on timed ω-trees
Finite automata on timed ω-trees
✍ Salvatore La Torre; Margherita Napoli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 264 KB

In the last decade Alur and Dill introduced a model of automata on timed !-sequences which extends the traditional models of ÿnite automata. In this paper, we present a theory of timed !-trees which extends both the theory of timed !-sequences and the theory of !-trees. The main motivation is to int

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