This work thoroughly covers the three fundamental areas of computer theory--formal languages, automata theory, and Turing machines in an imaginative and pedagogically strong attempt to remove the unnecessary mathematical complications associated with the study of these subjects.
An easy-to-comprehend text for required undergraduate courses in computer theory, this work thoroughly covers the three fundamental areas of computer theory--formal languages, automata theory, and Turing machines. It is an imaginative and pedagogically strong attempt to remove the unnecessary mathematical complications associated with the study of these subjects. The author substitutes graphic representation for symbolic proofs, allowing students with poor mathematical background to easily follow each step. Includes a large selection of well thought out problems at the end of each chapter.