## Introduction to computer theoryAn 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. |

### What people are saying - Write a review

User Review - Flag as inappropriate

Cohen approaches formal language theory from a linguistic point of view but that does not prevent him from treating the subject with all the attention to detail that it requires. Where Aho waxes rigorous, Cohen is content to use hand-waving arguments. This preference might be considered a shortcoming, but results in a clearer and more intuitive text than would be possible otherwise. This text is a good choice for an undergraduate formal language course and/or a graduate automata lecture.

### Common terms and phrases

2PDA A-productions a's and b's accepts the language alphabet begin blank branch called cell CFG's Chapter character circuit concatenation context-free languages convert corresponding crash derivation tree edge labeled encoded exactly EXAMPLE Let FA's fe's final finite grammar HALT infinite input letters input string instruction Kleene star language accepted language defined mathematical Mealy machine means Moore machine move the TAPE nondeterministic nonterminals notation number of a's odd number output PALINDROME path PDA's possible problem PROD productions proof of Theorem prove Pumping Lemma PUSH read a b READ2 recursive definition recursively enumerable languages regular expression regular languages REJECT replace row-language Rule sequence simulate STACK Step string of a's string of terminals substring symbol TAPE HEAD TM TAPE TM's transition table Turing machine words of length