𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructions for alternating finite automata ∗

✍ Scribed by Fellah, A.; Jürgensen, H.; Yu, S.

Book ID
111876207
Publisher
Taylor and Francis Group
Year
1990
Tongue
English
Weight
550 KB
Volume
35
Category
Article
ISSN
0020-7160

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The finite graph problem for two-way alt
The finite graph problem for two-way alternating automata
✍ Mikołaj Bojańczyk 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Two-way alternating automata on inÿnite trees were introduced by Vardi (Reasoning about the part with two way

Alternating finite automata and star-fre
Alternating finite automata and star-free languages
✍ Kai Salomaa; Sheng Yu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 96 KB

For a given extended regular expression e we construct an equational representation of an alternating ÿnite automaton accepting the language denoted by e. For star-free extended regular expressions the construction yields a loop-free alternating ÿnite automaton. Also the inclusion in the opposite di