Theory of Computation: Formal Languages, Automata, and Complexity

Front Cover
Benjamin/Cummings Publishing Company, 1989 - Computers - 322 pages
0 Reviews

This book presents the foundations of theoretical computer science in a format accessible to undergraduate computer science students. Designed to serve as a text for a one-semester introductory course in the theory of computation, the book covers the traditional topics of formal languages, automata, computability, and computational complexity. In his book, Glenn Brookshear encourages students to appreciate the theoretical ideas as the foundation on which real problems are solved, rather than viewing them as unuseable abstractions. Theory of Computation covers regular, context-free, and general phrase-structure languages along with their associated automata, computability in the context of Turing machines, partial recursive functions and simple programming languages, and complexity theory with an introduction to some of the open classification problems relating to the classes P and NP.
0805301437B04062001

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Preliminaries
1
Finite Automata and Regular Languages
21
Pushdown Automata and ContextFree Languages
73
Copyright

5 other sections not shown

Common terms and phrases

About the author (1989)

J. Glenn Brookshear is an Associate Professor at Marquette University. He received his Ph.D. from New Mexico State University in 1975, then was hired by Marquette to build a strong Computer Science curriculum. In addition to his highly successful Computer Science: An Overview, Brookshear has authored Theory of Computation: Formal Languages, Automata, and Complexity, also published by Addison-Wesley.



0805301437AB04062001

Bibliographic information