Benjamin Aminof, Orna Kupferman, Omer Lev. On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata. In Iliano Cervesato, Helmut Veith, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Volume 5330 of Lecture Notes in Computer Science, pages 183-197, Springer, 2008. [doi]
@inproceedings{AminofKL08,
title = {On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata},
author = {Benjamin Aminof and Orna Kupferman and Omer Lev},
year = {2008},
doi = {10.1007/978-3-540-89439-1_14},
url = {http://dx.doi.org/10.1007/978-3-540-89439-1_14},
researchr = {https://researchr.org/publication/AminofKL08},
cites = {0},
citedby = {0},
pages = {183-197},
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings},
editor = {Iliano Cervesato and Helmut Veith and Andrei Voronkov},
volume = {5330},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-89438-4},
}