[clug] OT meta-regex question

[Gough, Chris]

> David Price replied:
>> On Tue, Feb 03, 2004 at 02:24:22PM +1100, Gough, Chris wrote:
>> <snip silly question>
>
> Regular expressions can be converted to finite state automata.  So
> what you want is an algorithm that can determine if the language
> accepted by two finite state automata intersect.

That sounds like a 'bingo', if such an algorithm exists.

> This page looks like it might be promising:
> http://odur.let.rug.nl/~vannoord/Fsa/
>
> It appears to have stuff both for converting regular expressions to
> finite state automaton, and for finding the intersection of finite
> state automaton.

You have thoroughly solved the version of my problem that can be described
as "I don't know what to type into google". Thankyou.

Chris


This email, and any attachments, may be confidential and also privileged.
If you are not the intended recipient:

Please notify the sender and delete all copies of this transmission along
with any attachments immediately.
You should not copy or use it for any purpose, nor disclose its contents to
any other person.