Büchi automata and their degrees of nondeterminism and ambiguity

Nondeterminism and ambiguity in abstract machines can be consider as consumable resources. This was first done by Goldstine, Kintala and Wotschke for finite automata. We extend their method to finite automata which accept words of infinite length, so-called regular ω-automata. We classify the automata with respect to the amount of nondeterminism and ambiguity that is needed to accept a corresponding regular ω-language and present examples for each of the classes. It is a well-known fact that the deterministic regular ω-languages are a proper subset of the nondeterministic ones. Hence we specify the amount of nondeterminism and ambiguity that is necessary to accept a nondeterministic regular ω-language. Finally, we show for all possible amounts of nondeterminism that there is no interrelation between nondeterminism and ambiguity.