Many years of practical experience in teaching discrete mathematics form the basis of this text book. Part I contains problems on such topics as Boolean algebra,
k-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolean minimization and logical design. The exercises are preceded by ample theoretical background material. For further study the reader is referred to the extensive bibliography. Part II follows the same structure as Part I, and gives helpful hints and solutions.
Audience:This book will be of great value to undergraduate students of discrete mathematics, whereas the more difficult exercises, which comprise about one-third of the material, will also appeal to postgraduates and researchers.
Preface. I: Problems. 1. Representations of Boolean Functions. 2. Closed Classes and Completeness in Boolean Algebra. 3. Many-Valued Logics. 4. Graphs and Networks. 5. Elements of Coding Theory. 6. Finite Automata. 7. Elements of Algorithm Theory. 8. Combinatorics. 9. Boolean Minimization. 10. Logical Design. II: Answers, Hints, Solutions. 1. Representations of Boolean Functions. 2. Closed Classes and Completeness in Boolean Algebra. 3. Many-Valued Logics. 4. Graphs and Networks. 5. Elements of Coding Theory. 6. Finite Automata. 7. Elements of Algorithm Theory. 8. Combinatorics. 9. Boolean Minimization. 10. Logical Design. Bibliography. Index.
Many years of practical experience in teaching discrete mathematics form the basis of this text book. Part I contains problems on such topics as Boolean algebra,
k-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolean minimization and logical design. The exercises are preceded by ample theoretical background material. For further study the reader is referred to the extensive bibliography. Part II follows the same structure as Part I, and gives helpful hints and solutions.
Audience:This book will be of great value to undergraduate students of discrete mathematics, whereas the more difficult exercises, which comprise about one-third of the material, will also appeal to postgraduates and researchers.
I Problems.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.- II Answers, Hints, Solutions.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.
Inhaltsverzeichnis
Preface. I: Problems. 1. Representations of Boolean Functions. 2. Closed Classes and Completeness in Boolean Algebra. 3. Many-Valued Logics. 4. Graphs and Networks. 5. Elements of Coding Theory. 6. Finite Automata. 7. Elements of Algorithm Theory. 8. Combinatorics. 9. Boolean Minimization. 10. Logical Design. II: Answers, Hints, Solutions. 1. Representations of Boolean Functions. 2. Closed Classes and Completeness in Boolean Algebra. 3. Many-Valued Logics. 4. Graphs and Networks. 5. Elements of Coding Theory. 6. Finite Automata. 7. Elements of Algorithm Theory. 8. Combinatorics. 9. Boolean Minimization. 10. Logical Design. Bibliography. Index.
Klappentext
Many years of practical experience in teaching discrete mathematics form the basis of this text book. Part I contains problems on such topics as Boolean algebra, k-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolean minimization and logical design. The exercises are preceded by ample theoretical background material. For further study the reader is referred to the extensive bibliography. Part II follows the same structure as Part I, and gives helpful hints and solutions.
Audience:This book will be of great value to undergraduate students of discrete mathematics, whereas the more difficult exercises, which comprise about one-third of the material, will also appeal to postgraduates and researchers.
Springer Book Archives
