In this thesis, two methods for automatic enumeration of permutation classes are studied. The first method extends on the theory of combinatorial exploration. We review how combinatorial exploration works as a two phases process: the first phase ...