Formal Models of Computation - The Ultimate Limits of Computing

Abstract

Part 1 The finite state paradigm: regular expressions and acceptors properties of regular languages transducers and other variations. Part 2 Context-free grammars and automata: basic grammar definitions pushdown store automata properties of context-free languages. Part 3 General computability models: context-sensitive languages Turing machines and computability the universal machine and impossible computations.