Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!uwm.edu!csd4.csd.uwm.edu!litow
From: litow@csd4.csd.uwm.edu (Bruce E Litow)
Newsgroups: comp.theory
Subject: subset construction
Message-ID: <1284@uwm.edu>
Date: 1 Dec 89 16:07:23 GMT
Sender: news@uwm.edu
Reply-To: litow@csd4.csd.uwm.edu (Bruce E Litow)
Organization: University of Wisconsin-Milwaukee
Lines: 2

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).


Brought to you by Super Global Mega Corp .com