litow@csd4.csd.uwm.edu (Bruce E Litow) (12/02/89)
I would like a reference for a proof that the subset construction for finite automata is sharp ( 2^n state DFA needed for n state FA).