Core Concepts and Framework
Zohar Manna's Mathematical Theory of Computation is a seminal work that transforms the "art" of debugging into a rigorous science. Originally published in 1974, it remains a foundational text for graduate students and advanced undergraduates in computer science.
For those looking to study this classic, it was republished by Dover Publications in 2003, making it more accessible to modern students. Digitized versions and excerpts can often be found through academic repositories like the Internet Archive or university course documents. Finite Automata: The simplest model, capable of recognizing
- Finite Automata: The simplest model, capable of recognizing regular languages. Manna formalizes these using state-transition functions, providing the mathematical bedrock for lexical analysis in compilers.
- Pushdown Automata & Context-Free Languages: Extending the finite model with a stack memory, this section lays the groundwork for parsing programming languages.
- Turing Machines: The ultimate model of computation. Manna uses Turing machines not just as a calculator, but as a device to define the boundaries of what can be solved algorithmically.
Flowchart Schemas
: Analysis of decision problems and the formalization of program structures within predicate calculus. Flowchart Schemas : Analysis of decision problems and
by McGraw-Hill. It is widely recognized for transitioning the "art" of program debugging into a formal mathematical science. Google Books Finite Automata: The simplest model
2.2 Recursive Function Theory
(2007), which updates these concepts for automated decision procedures. How to Access the Material
The text is organized into key areas that define the theoretical landscape of software: Computability
