On the Succinctness of Nondeterminism

Abstract. Much is known about the differences in expressiveness and succinctness between nondeterministic and deterministic automata on infinite words. Much less is known about the relative succinctness of the different classes of nondeterministic automata. For example, while the best translation from a nondeterministic B

• Type: Conference
• Year: 2006
• Where: ATVA
• Authors: Benjamin Aminof, Orna Kupferman
• Keywords: ATVA 2006, Deterministic B¨uchi Automata, Hardware, Nondeterministic Automata, Nondeterministic Co-B¨uchi Automaton