R.Bryant Graph-Based Algorithms for Boolean Function Manipulation, 1986
Pour comprendre l' algo d'Angluin
Dana Angluin: Learning Regular Sets from Queries and Counterexamples Inf. Comput. 75(2): 87-106 (1987), ou les transparents de Vasin Punyakanok
Un livre un peu difficile (voir chapitres 1 et 8)
Dominique Perrin, Jean-Eric Pin. Infinite words: automata, semigroups, logic and games. Academic Press, 2004
Un livre facile
Gopalakrishnan. Computation Engineering. Springer, 2006