rdubey@eecs.wsu.edu (Rakesh Dubey - grad student) (03/09/91)
I am sorry about lack of clarity in a problem that I posted. The correct (hopefully) version goes: In the description (Q, A, d, q, F) , a set of states Q, an alphabet A and a start state q are given. The only things that one can choose are the transition function d and the accept states. Now with this data we can construct a finite number of DFAs and NFAs (say D and N respectively). (NFAs have lambda transitions). My question (again) is: Is there some interesting mapping from the set N to the set D? Can we say how many NFAs will in general correspond to a given DFA? -- Rakesh Dubey rdubey@yoda.eecs.wsu.edu -- Rakesh Dubey rdubey@yoda.eecs.wsu.edu