Theoretical foundations of computer science
Dino Mandrioli, Carlo Ghezzi · 1987
Mathematical Background Models for Computer Science: Automata and Grammars Solvable and Unsolvable Problems The Complexity of Computing Formal Semantics Proving Program Properties Nondetermination and Parallel Computation.