Skip to content
ISBN: 1461273099
ISBN13: 9781461273097

Automata and Computability

$37.99List Price: $79.99
Save $42.00!
ISBN: 1461273099
ISBN13: 9781461273097
Formats

Conditions

A read copy that remains in clean condition.

Formats

Conditions

A read copy that remains in clean condition.

See all 1 editionsfrom $37.99

Book Overview

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Then, material on pushdown automata provides a broader class of models and enables the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and G del's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

Format:
Paperback
Language:
English
ISBN:
1461273099
ISBN13:
9781461273097
Release Date:
October 2012
Publisher:
Springer
Length:
400 Pages
Weight:
0.55 lbs.
Dimensions:
0.9″ × 6.1″ × 9.2″
ComputersComputers & Technology

More by Dexter C. Kozen

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.