Introduction to computer theory

Front Cover
John Wiley & Sons Australia, Limited, 1986 - Computers - 823 pages
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.

From inside the book

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. 


Recursive Definitions

31 other sections not shown

Common terms and phrases

About the author (1986)

Professor of Economics at the University of Paris.

Bibliographic information