Status
Available
Call number
Library's review
Indeholder "Preface", "Chapter 0. An Essay on Discrete Structures", " A. A View of Computer Science", " B. On Formal Methods", " C. Analogy", " D. Abstraction", "Chapter 1. Sets, Functions, and Relations", " A. Sets and Sequences", " B. Set Containment", " C. The Empty Set", " D. The Power Set", "
Her er for en gangs skyld en bog med gode eksempler, fx side 13 hvor "Chinese ring puzzle" bliver brugt som eksempel på udforskning af et ukendt område ved at betragte det som tilstande og transitioner mellem tilstande..
Show More
E. Operations on Sets", " F. Order", " G. Relations", " H. Properties of Relations", " I. Partitions", " J. The Principle of Inclusion and Exclusion ", " K. Ordered Sets", " L. Operations on Relations", " M. Functions", " N. Matrices", " O. Matrix Representation of Relations", " P. Some Special Matrices", " Q. Transitive Closure", " R. Partially Ordered Sets and Lattices", " S. Viewing Relations as Functions", " T. Another View of Functions", " U. Boolean Algebra", " V. Switching Algebra", "Chapter 2. Directed Graphs", " A. Directed Graphs", " B. Graphs and Matrices", " C. Warshall's Algorithm", " D. Labeled Graphs", " E. Extensions of Functions and Relations", " F. Calculating the Set of Labeled Paths", " G. Finite State Machines - Applications", " H. Equivalence Relations on Graphs", "Chapter 3. Algebraic Systems", " A. Algebraic Systems", " B. Groupoids", " C. Application of Algebra to the Control Structure of a Program", " D. Homomorphisms", " E. An Example of Homomorphisms Applied", " F. Congruences", " G. Admissible Partitions", " H. Relationship Between Homomorphisms, Congruences, and Admissible Partitions", " I. Programs", " J. Groups", " K. Groups and Their Graphs", " L. Application of Congruences to Finite State Machines", "Chapter 4. Formal Systems", " A. Syntax and Semantics", " B. Recursive Definitions and Recursive Functions", " C. Algorithms", " D. Turing Machines", " E. Formal Deductive Systems", "Chapter 5. Trees", " A. Trees", " B. Tree Domains", " C. Homomorphisms and Congruences on Trees", " D. Automata on Trees", " E. Tree Rewriting Systems", " F. Some Additional Applications of Trees", " G. Lists", " H. Structural Induction on Lisp-Like Lists", " I. Data Structure", "Chapter 6. Programming Applications.", " A. Data Structures", " B. An Algebraic Style Correctness Proof for a Simple Compiler", " C. Translating Expressions of a Stack Machine", " D. Translating a Stack Machine to a Store-Pointer Machine", " E. Transforming the Store-Pointer Machine to the Address-Program Machine", " F. Transforming the Store-Sequence Machine to the Single-Address, Single-Accuulator Machine", "Index".Her er for en gangs skyld en bog med gode eksempler, fx side 13 hvor "Chinese ring puzzle" bliver brugt som eksempel på udforskning af et ukendt område ved at betragte det som tilstande og transitioner mellem tilstande..
Show Less
Publication
John Wiley & Sons Inc (1980), Paperbound, 320 pages
This Wiley International Edition is part of a continuing program of paperbound textbooks especially designed for students and professional people overseas. It is an unabridged reprinting of the original hardbound edition, which is also available from your bookseller.
Language
Original language
English
Physical description
320 p.; 22.7 cm
ISBN
0471032085 / 9780471032083
Local notes
Omslag: Ikke angivet
Omslaget viser titel og forfatter med hvid skrift på blå baggrund
Indskannet omslag - N650U - 150 dpi
Side 260: Mængden af Algol 60 programmer, der terminerer, er rekursivt enumerable
Omslaget viser titel og forfatter med hvid skrift på blå baggrund
Indskannet omslag - N650U - 150 dpi
Side 260: Mængden af Algol 60 programmer, der terminerer, er rekursivt enumerable
Pages
320
DDC/MDS
| 519.4 |