On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata

DOI10.1007/978-3-540-89439-1_14zbMath1182.68098OpenAlexW1536608616MaRDI QIDQ5505553

Benjamin Aminof, Omer Lev, Orna Kupferman

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The Quest for a Tight Translation of Büchi to co-Büchi Automata

This page was built for publication: On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata