6 Dec 2000 00:11:26 -0500

Related articles |
---|

Meaning of symbol in set theory? mikesw@whiterose.net (2000-12-06) |

Re: Meaning of symbol in set theory? offner@zko.dec.com (Carl Offner) (2000-12-07) |

Re: Meaning of symbol in set theory? soenke.kannapinn@wincor-nixdorf.com (SÃ¶nke Kannapinn) (2000-12-08) |

Re: Meaning of symbol in set theory? eil@kingston.net (John H. Lindsay) (2000-12-08) |

From: | mikesw@whiterose.net (M Sweger) |

Newsgroups: | comp.compilers |

Date: | 6 Dec 2000 00:11:26 -0500 |

Organization: | DataHaven Project, Inc (http://www.dhp.com) |

Keywords: | theory, question |

Posted-Date: | 06 Dec 2000 00:11:25 EST |

Hi,

I'm reading some of Tarjans old papers and he uses set theory alot when

applied to graphs. BTW, he writes a lot: about 183 papers so far. :)

My question is what is the meaning of the symbol of the backwards

capital E that is sometimes in bold. It is used in his paper on Depth

First Search and others.

Also in the above mentioned paper it talks about "Biconnectivity",

"Strong Connectivity" and "Triconectivity" along with "fronds" and

"cross-links". Have these concept ever been applied to Compilers and

such? My compiler books mention DFS but don't address the

connectivity issues.

While I'm asking, do any papers for compilers try to apply Group

Theory besides just Graph and Set Theory? The only paper I came

across by Tarjan mentioned semigroups. I'll have to dig out a book on

this to find the meaning of this term or go to the mathematical web

page on its definition.

Thanks

--

Mike,

mikesw@whiterose.net

[It usually means "there exists", usually followed by a symbol, then a

vertical bar read as "such that" and an expression including the symbol.

-John]

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.