Mathematical Foundations of Computer Science
by Susan Rodger
Publisher: Duke University 1998
Description:
These lecture notes present an introduction to theoretical computer science including studies of abstract machines, the language hierarchy from regular languages to recursively enumerable languages, noncomputability and complexity theory.
Download or read it online for free here:
Download link
(multiple PDF, PS files)
Similar books
Introduction to Soft Computing
by Eva Volna - Bookboon
This book gives an introduction to Soft Computing, which aims to exploit tolerance for imprecision, uncertainty, approximate reasoning, and partial truth in order to achieve close resemblance with human like decision making.
(9374 views)
by Eva Volna - Bookboon
This book gives an introduction to Soft Computing, which aims to exploit tolerance for imprecision, uncertainty, approximate reasoning, and partial truth in order to achieve close resemblance with human like decision making.
(9374 views)
How to think like a Computer Scientist (C++ Version)
by Allen B. Downey
This book teaches you to think like a computer scientist - to combine the best features of mathematics, natural science, and engineering, to use formal languages to denote ideas, to observe the behavior of complex systems, form hypotheses, etc.
(25145 views)
by Allen B. Downey
This book teaches you to think like a computer scientist - to combine the best features of mathematics, natural science, and engineering, to use formal languages to denote ideas, to observe the behavior of complex systems, form hypotheses, etc.
(25145 views)
Foundations of Computation
by Carol Critchlow, David Eck - Hobart and William Smith Colleges
The book covers material on logic, sets, and functions that would often be taught in a course in discrete mathematics. The second part covers automata, formal languages, and grammar that would ordinarily be encountered in an upper level course.
(15332 views)
by Carol Critchlow, David Eck - Hobart and William Smith Colleges
The book covers material on logic, sets, and functions that would often be taught in a course in discrete mathematics. The second part covers automata, formal languages, and grammar that would ordinarily be encountered in an upper level course.
(15332 views)
Essentials of Theoretical Computer Science
by F. D. Lewis - University of Kentucky
This text is a broad introduction to the field, presented from a computer science viewpoint for computer scientists. This was designed to be used in a one-semester course for senior computer science majors or first year masters students.
(14433 views)
by F. D. Lewis - University of Kentucky
This text is a broad introduction to the field, presented from a computer science viewpoint for computer scientists. This was designed to be used in a one-semester course for senior computer science majors or first year masters students.
(14433 views)