This book explains how to use relational and graph-theoretic methods systematically in computer science. Results are first motivated by practical examples and then derived algebraically.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
1. Sets.- 2. Homogeneous Relations.- 2.1 Boolean Operations on Relations.- 2.2 Transposition of a Relation.- 2.3 The Product of Two Relations.- 2.4 Subsets and Points.- 2.5 References.- 3. Transitivity.- 3.1 Orderings and Equivalence Relations.- 3.2 Closures and Closure Algorithms.- 3.3 Extrema, Bounds, and Suprema.- 3.4 References.- 4. Heterogeneous Relations.- 4.1 Bipartite Graphs.- 4.2 Functions and Mappings.- 4.3 n-ary Relations in Data Bases.- 4.4 Difunctionality.- 4.5 References.- 5. Graphs: Associated Relation, Incidence, Adjacency.- 5.1 Directed Graphs.- 5.2 Graphs via the Associated Relation.- 5.3 Hypergraphs.- 5.4 Graphs via the Adjacency Relation.- 5.5 Incidence and Adjacency.- 5.6 References.- 6. Reachability.- 6.1 Paths and Circuits.- 6.2 Chains and Cycles.- 6.3 Terminality and Foundedness.- 6.4 Confluence and Church-Rosser Theorems.- 6.5 Hasse Diagrams and Discreteness.- 6.6 References.- 7. The Category of Graphs.- 7.1 Homomorphisms of 1-Graphs.- 7.2 More Graph Homomorphisms.- 7.3 Covering of Graphs and Path Equivalence.- 7.4 Congruences.- 7.5 Direct Product and n-ary Relations.- 7.6 References.- 8. Kernels and Games.- 8.1 Absorptiveness and Stability.- 8.2 Kernels.- 8.3 Games.- 8.4 References.- 9. Matchings and Coverings.- 9.1 Independence.- 9.2 Coverings.- 9.3 Matching Theorems.- 9.4 Starlikeness.- 9.5 References.- 10. Programs: Correctness and Verification.- 10.1 Programs and Their Effect.- 10.2 Partial Correctness and Verification.- 10.3 Total Correctness and Termination.- 10.4 Weakest Preconditions.- 10.5 Coverings of Programs.- 10.6 References.- General References.- Name Index.- Table of Symbols.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 28,85 per la spedizione da Regno Unito a U.S.A.
Destinazione, tempi e costiEUR 3,41 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Mar3113020236200
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783642779701_new
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Relational methods can be found at various places incomputer science, notably in data base theory, relationalsemantics of concurrency, relationaltype theory, analysisof rewriting systems, and modern programming languagedesign. In addition, they appear in algorithms analysis andin the bulk of discrete mathematics taught to computerscientists.This book is devoted to the background of these methods. Itexplains how to use relational and graph-theoretic methodssystematically in computer science.A powerful formal framework of relational algebra isdeveloped with respect to applications to a diverse range ofproblem areas. Results are first motivated by practicalexamples, often visualized by both Boolean 0-1-matrices andgraphs, and then derived algebraically. 320 pp. Englisch. Codice articolo 9783642779701
Quantità: 2 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Relational methods can be found at various places incomputer science, notably in data base theory, relationalsemantics of concurrency, relationaltype theory, analysisof rewriting systems, and modern programming languagedesign. In addition, the. Codice articolo 5070439
Quantità: Più di 20 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 320. Codice articolo 2648028224
Quantità: 4 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 320 203 Figures, 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Codice articolo 44787103
Quantità: 4 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. PRINT ON DEMAND pp. 320. Codice articolo 1848028234
Quantità: 4 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Relational methods can be found at various places incomputer science, notably in data base theory, relationalsemantics of concurrency, relationaltype theory, analysisof rewriting systems, and modern programming languagedesign. In addition, they appear in algorithms analysis andin the bulk of discrete mathematics taught to computerscientists.This book is devoted to the background of these methods. Itexplains how to use relational and graph-theoretic methodssystematically in computer science.A powerful formal framework of relational algebra isdeveloped with respect to applications to a diverse range ofproblem areas. Results are first motivated by practicalexamples, often visualized by both Boolean 0-1-matrices andgraphs, and then derived algebraically.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 320 pp. Englisch. Codice articolo 9783642779701
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Relational methods can be found at various places incomputer science, notably in data base theory, relationalsemantics of concurrency, relationaltype theory, analysisof rewriting systems, and modern programming languagedesign. In addition, they appear in algorithms analysis andin the bulk of discrete mathematics taught to computerscientists.This book is devoted to the background of these methods. Itexplains how to use relational and graph-theoretic methodssystematically in computer science.A powerful formal framework of relational algebra isdeveloped with respect to applications to a diverse range ofproblem areas. Results are first motivated by practicalexamples, often visualized by both Boolean 0-1-matrices andgraphs, and then derived algebraically. Codice articolo 9783642779701
Quantità: 1 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. reprint edition. 310 pages. 9.06x6.06x0.71 inches. In Stock. Codice articolo x-3642779700
Quantità: 2 disponibili