sreeniva@fas.ri.cmu.edu (R S Sreenivas) (11/08/90)
Given a regular expression E on a finite aplhabet, what is the complexity of computing an equivalent regular expression E' such that E' is in the disjunctive normal form. Any pointers/references will be appreciated! Thanks! -R.S.