S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

Y. Breitbart, H. B. Hunt, . Iii, J. Daniel, and . Rosenkrantz, On the size of binary decision diagrams representing Boolean functions, Theoretical Computer Science, vol.145, issue.1-2, pp.45-69, 1995.

O. Carton, Langages formels, calculabilité et complexité. Vuibert, Paris. Chin-Liang Chang et Richard Char-Tung Lee, Computer Science and Applied Mathematics, 1973.

R. David, K. Nour, and C. Raffalli, Introduction à la logique, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00396917

J. Goubault-larrecq and I. Mackie, Proof Theory and Automated Deduction, Applied Logic Series, vol.6, p.de, 1997.

M. A. Harrison, Introduction to Formal Language Theory, 1978.

D. E. Knuth, The Art of Computer Programming, fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions, vol.4, 2008.

D. E. Knuth, fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol.4, 2011.

D. E. Knuth, The Art of Computer Programming, vol.4, 2015.

R. Lassaigne and . Michel-de-rougemont, Logic and Complexity. Discrete Mathematics and Theoretical Computer Science, 2004.

H. R. Lewis, Satisfiability problems for propositional calculi, vol.13, pp.45-53, 1979.
DOI : 10.1007/bf01744287

C. Papadimitriou, Computational Complexity, 1993.

S. Perifel, Complexité algorithmique. Ellipses, 2014.

, Parsing Theory, Volume I: Languages and Parsing, Seppo Sippu et Eljas Soisalon-Soininen, 1988.

I. Wegener, Branching Programs and Binary Decision Diagrams: Theory and Applications, SIAM Monographs in Discrete Mathematics and Applications, 2000.
DOI : 10.1137/1.9780898719789

G. Winskel, The Formal Semantics of Programming Languages. Foundations of Computing, 1993.