From: Nikolai Weibull <mailing-lists.ruby-talk@...>
Date: 2005-05-04T20:48:28+09:00
Subject: Re: Inverting a regular expression?

Dan Doel, May 4:

> On Wednesday May 4 2005 6:06 am, Nikolai Weibull wrote:

> > Actually, it's not a very good point, as it isn't quite right.  See my
> > response to this thread for the corrected method of conversion.

> What was wrong with my method? DFAs are required to be fully defined/complete 
> (at least, that's how I was taught), so there will never be a need to add a 
> sink state, as you're required to have one already (only an NFA can be 
> missing transitions).

I stated this in my initial response as well.

> And by "invert the accept states," I meant exactly what you said later: "make 
> any accept state non-accepting and any non-accepting state accepting." I 
> suppose I should have worded it more precisely.

Again, that's what I said in my initial response.  I just wanted to
clarify a bit, as Harry for some reason didn't continue his discussion
on that sub-thread.  I'm not trying to discredit you,
        nikolai

-- 
Nikolai Weibull: now available free of charge at http://bitwi.se/!
Born in Chicago, IL USA; currently residing in Gothenburg, Sweden.
main(){printf(&linux["\021%six\012\0"],(linux)["have"]+"fun"-97);}