I need to convert this Epsilon NFA to a DEA and this is the result I got. (see post below)
Did I get this right?
>>345760
As far as I can tell, yes.
Imagine it starts in R: always accept.
Imagine it starts in Q: A, ->P, e>R, accept. B, ->R, accept. C, ->P, e>R, accept.
Imagine it starts in P: e, e>R, accept. A, e>Q, ->P, e>R, accept. B, e>Q, ->R, accept. C ->R accept.
So for any string longer than zero characters, it will accept from any state.
In addition, state P will accept epsilon.
It starts in state P, so this proves it accepts [abc]* .
I'm glad. I figured all other states I got (like qr, pr etc.) were equivalent to pqr. Aside from that I made an extensive version of it but I'm glad to see my understanding is correct. thanks