Abstract
In the automata-theoretic approach to verification, specifications are translated to automata. Complexity considerations motivate the distinction between different types of automata. The expressiveness gap between deterministic and nondeterministic Buchi word automata and Buchi and Rabin tree automata are given. The main result shows that word language is recognizable by a nondeterministic Buchi word automaton but not by a deterministic Buchi word automaton if the derived language is recognizable by a Rabin tree automaton and not by a Buchi tree automaton. Results provide an exponential determinization of Buchi tree automata that recognizes derived languages.
| Original language | English |
|---|---|
| Pages (from-to) | 322-332 |
| Number of pages | 11 |
| Journal | Proceedings - Symposium on Logic in Computer Science |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 11th Annual IEEE Symposium on Logic in Computer Science, LICS'96 - New Brunswick, NJ, USA Duration: 27 Jul 1996 → 30 Jul 1996 |
Bibliographical note
Funding Information:The first author was supported in part by BSF grant 9800096, and by a grant from Minerva. The third author was supported in part by NSF grants CCR-9988322, CCR-0124077, CCR-0311326, IIS-9908435, IIS-9978135, EIA-0086264, and ANI-0216467, by BSF grant 9800096, by Texas ATP grant 003604-0058-2003, and by a grant from the Intel Corporation.