Introduction to languages and the theory of computation
Author(s)
Bibliographic Information
Introduction to languages and the theory of computation
（McGraw-Hill computer science series）
McGraw-Hill, c1997
2nd ed
- : hbk
- : pbk
Available at 10 libraries
Note
Includes bibliographical references (p. 438-440) and indexes
Description and Table of Contents
- Volume
-
: hbk ISBN 9780070408456
Description
This text introduces undergraduates to the theory of computation, with an emphasis on formal languages, automata and abstract models of computation and computability. Features include an introduction to computational complexity and NP-completeness, numerous examples, and inclusion of Ogden's Lemma.
Table of Contents
- Mathematical notation and techniques
- regular languages and finite automata
- context-free languages and pushdown automata
- tuning machines and their languages
- unsolvable problems and computable functions.
- Volume
-
: pbk ISBN 9780071154680
Description
This is an introduction for undergraduates to the theory of computation which emphasizes formal languages, automata, and abstract models of computation and computability. It also includes an introduction to computational complexity and NP-completeness. Key features of the book includes: numerous examples and informal discussions; extended discussion of mathematical induction; an introduction to computational complexity; and inclusion of Ogden's Lemma.
Table of Contents
- Mathematical notation and techniques
- regular languages and finite automata
- context-free languages and pushdown automata
- Turing machines and their languages
- unsolvable problems and computable functions.
by "Nielsen BookData"