champarnaud1989maxmin (242B)
1 # champarnaud1989maxmin 2 3 They study the subsets of {0,1}^n where the [state_complexity] (number of [states] needed by a [DFA]) is maximal, and show that it is of the order of 2^n/n 4 5 Up: [academic_paper] about [knowledge_compilation_automata]