[FOM] regular expressions

[Olivier Gerard]

Dear Adam,

Competent members have already answered your
original queries, but if you are also concerned
by the performance of regular expression
matching using NFAs or DFAs
you might be interested by the work of Russ Cox
on the subject:

http://swtch.com/~rsc/regexp/regexp1.html

Olivier Gérard


On 10/30/07, Adam Kolany <dr.a.kolany at wp.pl> wrote:
> I am sorry for possibly trivial questions:
>     1. Is the problem of equality of languages given by two regular
> expresions equal decidable?
>     2. Is there a (decidable) formal system for proving the above
> equalities?
> regards, Adam Kolany
>