Introduction to Computer Theory By Daniel I.A. Cohen
2007 | 648 Pages | ISBN: 8126513349 | PDF | 30 MB
This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found refreshing. The goal of the book is to provide a firm understanding of the principles and the big picture of where computer theory fits into the field. Table Of Contents: Table of contents Automata Theory ?Background ?Languages ?Recursive Definitions ?Regular Expressions ?Finite Automata ?Transition Graphs ?Kleene's Theorem ?Finite Automata with Output ?Regular Languages ?Nonregular Languages ?Decidability Pushdown Automata Theory ?Context-Free Grammars ?Grammatical Format ?Pushdown Automata ?CFG = PDA ?Non-Context-Free Languages ?Context-Free Languages ?Decidability Turing Theory ?Turing Machines ?Post Machines ?Minsky's Theorem ?Variations on the TM ?TM Languages ?The Chomsky Hierarchy ?Computers Bibliography Indexes Special Features: ?Computer Scientists ?Students ?Professors