Beschreibung:
The abstract branch of theoretical computer science known as Computation Theory typically appears in undergraduate academic curricula in a form that obscures both the mathematical concepts that are central to the various components of the theory and the relevance of the theory to the typical student. This regrettable situation is due largely to the thematic tension among three main competing principles for organizing the material in the course.
PROLEGOMENA.- Mathematical Preliminaries.- STATE.- Online Automata: Exemplars of #x201C;State#x201D;.- Finite Automata and Regular Languages.- Applications of the Myhill#x2013;Nerode Theorem.- Enrichment Topics.- ENCODING.- Countability and Uncountability: The Precursors of #x201C;Encoding#x201D;.- Enrichment Topic: #x201C;Efficient#x201D; Pairing Functions, with Applications.- Computability Theory.- NONDETERMINISM.- Nondeterministic Online Automata.- Nondeterministic FAs.- Nondeterminism in Computability Theory.- Complexity Theory.