On Oct 24, David Garamond said: >- whether R1 is "a subset of" R2, i.e. all strings that match R1 will >also always match R2, but not necessarily the other way around; > >- whether R1 is "equivalent" or "equal" to R2, i.e. all strings that >match R1 will also always match R2, and all strings that match R2 will >also always match R1. > >- whether R1 does not "intersect" R2, i.e. no string can match both R1 >and R2 at the same time, a string can match either R1 or R2 but never both.
I'm taking a course at RPI right now called "models of computation". It's basically working with NFAs and DFAs and push-down automata and Turing machines and the like. There is probably a way to determine if DFAs and NFAs are a subset of each other, or equivalent, or don't intersect. But I don't think the same can be said for Perl's regexes. They're not regular. -- Jeff "japhy" Pinyan [EMAIL PROTECTED] http://www.pobox.com/~japhy/ RPI Acacia brother #734 http://www.perlmonks.org/ http://www.cpan.org/ <stu> what does y/// stand for? <tenderpuss> why, yansliterate of course. [ I'm looking for programming work. If you like my work, let me know. ] -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
