M. C. Chu-Carroll:
Algorithm of Kosaraju.
http://scienceblogs.com/ goodmath/2007/10/computing_strongly_connected_c.php.
Accessed 14 July 2011.
S. Chaki & A. Gurfinkel (2011):
Automated assume-guarantee reasoning for omega-regular systems and specifications.
ISSE 7(2),
pp. 131–139.
Available at http://dx.doi.org/10.1007/s11334-011-0148-1.
Rüdiger Ehlers & Bernd Finkbeiner (2010):
On the Virtue of Patience: Minimizing Büchi Automata.
In: Jaco van de Pol & Michael Weber: SPIN,
Lecture Notes in Computer Science 6349.
Springer,
pp. 129–145.
Available at http://dx.doi.org/10.1007/978-3-642-16164-3_10.
Kousha Etessami & Gerard J. Holzmann (2000):
Optimizing Büchi Automata.
In: Catuscia Palamidessi: CONCUR,
Lecture Notes in Computer Science 1877.
Springer,
pp. 153–167.
Available at http://dx.doi.org/10.1007/3-540-44618-4_13.
Rüdiger Ehlers (2010):
Minimising Deterministic Büchi Automata Precisely Using SAT Solving.
In: Ofer Strichman & Stefan Szeider: SAT,
Lecture Notes in Computer Science 6175.
Springer,
pp. 326–332.
Available at http://dx.doi.org/10.1007/978-3-642-14186-7_28.
N. Eén & N. Sörensson:
Minisat.
http://minisat.se/.
Accessed 13 August 2011.
M. Michel (1988):
Complementation is more difficult with automata on infinite words..
CNET, Paris.
Nir Piterman (2007):
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata.
CoRR abs/0705.2205.
Available at http://arxiv.org/abs/0705.2205.
Sven Schewe (2010):
Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata.
CoRR abs/1007.1333.
Available at http://arxiv.org/abs/1007.1333.
Ming-Hsien Tsai, Seth Fogarty, Moshe Y. Vardi & Yih-Kuen Tsay (2010):
State of Büchi Complementation.
In: Michael Domaratzki & Kai Salomaa: CIAA,
Lecture Notes in Computer Science 6482.
Springer,
pp. 261–271.
Available at http://dx.doi.org/10.1007/978-3-642-18098-9_28.