Re: regex/fsa theory

[Eray Ozkural]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Hi Bob,

What do you want to do?

The first one seems to be correct. I'm saying this without looking at the 
Cindrella book.

Thanks,

On Monday 18 March 2002 20:11, Bob Ham wrote:
> Hi all,
>
> I'm still chugging away on my regex rewrite uni project (which has been
> stripped down to a much smaller grammar, so I doubt it'll ever be useful
> for glibc,) but I've come accross a bit of a problem, which none of my
> textbooks seem to want to answer.  Seeing as there are other people
> doing regex stuff here (and likely other people that would know anyway,)
> I though I'd ask here:
>
> With the transition function for an nfa, does anybody know if:
>
>   delta(r,s) = x + epsilon_closure(x)
>
> or should it be
>
>   delta(r,s) = x
>
> assuming that delta returns a set of states?
>
> Cheers,
>
> Bob

- -- 
Eray Ozkural (exa) <address@hidden>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQE8mn54fAeuFodNU5wRAsyYAJ92pvmYXs3ifrKIVPzruyHf1XlfrwCeIvPV
F8sa8iKl+xndaKlRB0KCCtc=
=/ubT
-----END PGP SIGNATURE-----