|elimination methods... firstname.lastname@example.org (V.C. SREEDHAR) (1995-05-28)|
|Re: elimination methods... email@example.com (Michael Wolfe) (1995-06-23)|
|Re: elimination methods... firstname.lastname@example.org (1995-06-30)|
|Re: elimination methods... email@example.com (1995-07-05)|
|From:||firstname.lastname@example.org (Chris Smith)|
|Organization:||CONVEX News Network, Engineering (cnn.eng), Richardson, Tx USA|
|Date:||Fri, 30 Jun 1995 17:25:41 GMT|
From: Michael Wolfe <email@example.com>
Date: Fri, 23 Jun 1995 04:02:16 GMT
I ask the interval or
syntax-based group what they do in case of irreducible graphs, and
the answers are either fall back to iterative methods, or use node
splitting, or give up.
no science here.
Some science, perhaps. Elimination boils everything down to composition (ab),
alternation (a|b), and iteration (a*). There's a Tarjan paper that tells
how to parse an arbitrary directed graph and get an equivalent regexp.
Alas, I can't find the reference. It was someplace I don't read much,
perhaps JACM, something like 1980-85.
Return to the
Search the comp.compilers archives again.