Büchi automata and their degrees of nondeterminism and ambiguity

Authors:
Frank Niessner
Affiliations:
Computer Science Department, University of Frankfurt, Frankfurt, Germany
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Year:
2004

Citing 8
Cited 0

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
On measuring nondeterminism in regular languages

Information and Computation
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
On the relation between ambiguity and nondeterminism in finite automata

Information and Computation
Reasoning about infinite computations

Information and Computation
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
ω-automata

Automata logics, and infinite games

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.