[Manichean]

Originally Posted by chaley

Of course, you can write a regexp if you know *all* the utterances that you must match. For example, the regexp 'abba|abcba|abbbba' works fine.

I see what you did there
After reading your post, I believe my difficulties lie in understanding FSMs. Reading the introduction to the relevant Wikipedia entry obviously doesn't give an understanding of the subject... I'm going to read up on this, as this is relevant to my (private) interests, but it's going to have to be on the backburner for some while due to some Real Life interference.

Originally Posted by chaley

You might be interested in the paper at this linkthis link.It gets mathematical at times (lots of times), but it discusses how one translates REs used in searches to FSMs to really do the work.

Thanks for the link. I think, once I refresh my memory on some of the things I learned in computer sciences, that I should be able to understand that.