Mathematical structures for computer science

2nd ed.
  • 128 Want to read
  • 12 Currently reading
  • 2 Have read

My Reading Lists:

Create a new list


  • 128 Want to read
  • 12 Currently reading
  • 2 Have read

Buy this book

Last edited by ImportBot
December 19, 2023 | History

Mathematical structures for computer science

2nd ed.
  • 128 Want to read
  • 12 Currently reading
  • 2 Have read

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
W.H. Freeman
Language
English
Pages
618

Buy this book

Previews available in: English

Add another edition?

Book Details


Table of Contents

Preface
Page xi
Note to the Student
Page xv
Chapter 1. Logic, Induction, and Recursion
Page 1
1.1. Statements and Quantifiers
Page 1
1.2. Propositional Logic and Predicate Logic
Page 25
1.3. Proof Techniques
Page 39
1.4. Induction
Page 47
1.5. Recursion and Recurrence Relations
Page 59
Chapter 2. Sets and Combinatorics
Page 71
2.1. Sets
Page 71
2.2. Counting
Page 92
2.3. Permutations and Combinations
Page 98
2.4. The Binomial Theorem
Page 104
Chapter 3. Relations, Functions, and Matrices
Page 111
3.1. Relations
Page 111
3.2. Functions
Page 131
3.3. Matrices
Page 149
Chapter 4. Graphs and Trees
Page 157
4.1. Graph Terminology and Applications
Page 157
4.2. Computer Representations of Graphs
Page 168
4.3. Graph Algorithms
Page 180
4.4. Algorithms for Traversing Graphs
Page 197
Chapter 5. Structures and Simulations
Page 209
5.1. Structures-Simulation I
Page 210
5.2. Morphisms-Simulation II
Page 223
Chapter 6. Boolean Algebra and Computer Logic
Page 237
6.1. Logic Networks
Page 237
6.2. Minimization
Page 262
Chapter 7. Algebraic Structures
Page 281
7.1. Semigroups, Monoids, and Groups-Simulation I
Page 281
7.2. Substructures
Page 297
7.3. Morphisms-Simulation II
Page 306
7.4. Homomorphism Theorems
Page 319
7.5. Quotient Groups
Page 326
Chapter 8. Coding Theory
Page 339
8.1. Encoding
Page 339
8.2. Decoding
Page 359
Chapter 9. Finite-State Machines
Page 369
9.1. Machines-Simulation I
Page 369
9.2. Morphisms-Simulation II
Page 386
9.3. Machines as Recognizers
Page 399
Chapter 10. Machine Design and Construction
Page 419
10.1. Machine Minimization
Page 419
10.2. Building Machines
Page 432
10.3. Parallel and Serial Decompositions
Page 440
10.4. Cascade Decompositions
Page 455
Chapter 11. Computability
Page 467
11.1. Turing Machines-Simulation I
Page 467
11.2. The Universal Turing Machine-Simulation II and Unsolvability
Page 486
11.3. Computational Complexity
Page 496
Chapter 12. Formal Languages
Page 505
12.1. Classes of Languages
Page 505
12.2. Language Recognizers
Page 519
Answers to Practice Problems
Page 533
Answers to Selected Exercises
Page 563
Index
Page 607

Edition Notes

Includes index.

Published in
New York
Series
A Series of books in the mathematical sciences

Classifications

Dewey Decimal Class
510
Library of Congress
QA39.2 .G47 1987, QA39.2.G47 1987

The Physical Object

Pagination
xiv, 618 p. :
Number of pages
618

Edition Identifiers

Open Library
OL2716831M
ISBN 10
0716718022
LCCN
86009974
OCLC/WorldCat
13560909
LibraryThing
7817231
Goodreads
4906439

Work Identifiers

Work ID
OL1922611W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Loading indicator
Loading Lists

History

Download catalog record: RDF / JSON
December 19, 2023 Edited by ImportBot import existing book
December 19, 2023 Edited by ImportBot import existing book
September 17, 2021 Edited by ImportBot import existing book
March 12, 2020 Edited by Drini Added new cover
December 9, 2009 Created by WorkBot add works page