Nondeterminism in the presence of a diverse or unknown future

  • Authors:

  • Udi Boker;Denis Kuperberg;Orna Kupferman;Michał Skrzypczak

  • Affiliations:

  • IST Austria, Klosterneuburg, Austria;The Hebrew University, Jerusalem, Israel;The Hebrew University, Jerusalem, Israel;University of Warsaw, Poland

  • Venue:
  • ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.