Abstract
Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata.
| Original language | English |
|---|---|
| Title of host publication | Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings |
| Pages | 89-100 |
| Number of pages | 12 |
| Edition | PART 2 |
| DOIs | |
| State | Published - 2013 |
| Event | 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 - Riga, Latvia Duration: 8 Jul 2013 → 12 Jul 2013 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Number | PART 2 |
| Volume | 7966 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 |
|---|---|
| Country/Territory | Latvia |
| City | Riga |
| Period | 8/07/13 → 12/07/13 |
Bibliographical note
Funding Information:This work was supported in part by the Polish Ministry of Science grant no. N206 567840, Poland’s NCN grant no. DEC-2012/05/N/ST6/03254, Austrian Science Fund NFN RiSE (Rigorous Systems Engineering), ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), and ERC Grant QUALITY. The full version is available at the authors’ URLs.