Includes bibliographical references (pages 619-620) and index.
CONTENTS NOTE
Text of Note
Background -- Languages -- Recursive definitions -- Regular expressions -- Finite automata -- Transition graphs -- Kleene's theorem -- Finite automata with output -- Regular languages -- Nonregular languages -- Decidability -- Context-free grammars -- Grammatical format -- Pushdown automata -- DFG = PDA -- Non-context-free languages -- Context-free languages -- Decidability -- Turing machines -- Post machines -- Minsky's theorem -- Variations on the TM -- TM languages -- The Chomsky hierarchy -- Computers.
0
SUMMARY OR ABSTRACT
Text of Note
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". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.