Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re(2): A Regexp Assembler/Compiler

by gumby (Scribe)
on Jun 19, 2002 at 15:29 UTC ( [id://175723]=note: print w/replies, xml ) Need Help??


in reply to Re: A Regexp Assembler/Compiler
in thread A Regexp Assembler/Compiler

I don't think that there is anything wrong in posing this question in the language of boolean logic and set theory. Any solution set of the above subroutine will be the union of the complement of the solution set of the first regexp and the solution sets of the other regexps. Although finding a regexp whose solution set this is would be non-trivial, as Abigail-II points out.

Replies are listed 'Best First'.
Re(3): A Regexp Assembler/Compiler
by gumby (Scribe) on Jun 19, 2002 at 15:56 UTC
    On further reflection, it's actually quite likely that algorithms have been developed for similar problems (ie. Boolean algebra's, elimination theory etc.).

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://175723]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (6)
As of 2024-03-28 12:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found