A fundamentally sound exploration of computer theory, it has at its core one compound goal--to define a computer and then explain the definition. The author builds mathematical skills while presenting the subject matter. The text is divided into three parts covering automata theory, pushdown automata theory, and Turing theory. Additionally, two new theorems are explored, including the regular language division theorem and the Rabin-Shephardson Theorem. Also introduced in this printing are transition Turing machines. A table of theorems and index complete this work.
MORE FROM THIS COLLECTION