[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: regex/fsa theory
From: |
Bob Ham |
Subject: |
Re: regex/fsa theory |
Date: |
23 Mar 2002 14:39:52 +0000 |
On Fri, 2002-03-22 at 00:44, Eray Ozkural wrote:
> What do you want to do?
I'm doing an fsa minimiser using the (I assume) usual method of marking
pairs. But, I don't know if I should be including the epsilon closure
when checking which pairs are already marked. I assume I should be,
given that what's at issue is whether or not the transitions make a
difference to the strings that are accepted, and the epsilon transitions
make such a difference.
> The first one seems to be correct. I'm saying this without looking at the
> Cindrella book.
I don't believe I know the Cinderella book. I've got the Ullman crew's
Compilers and Martin's Introduction to Languages and Theory of
Computation. Should I be adding one to that?
Cheers,
Bob
--
Bob Ham: address@hidden http://pkl.net/~node/
My music: http://mp3.com/obelisk_uk
GNU Hurd: http://hurd.gnu.org/