Elementary Computability, Formal Languag
โ Robert McNaughton
๐ Library
๐
1981
๐ English
โ Scribed by R. Mcnaughton
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of