Automata and Computability

Dexter C. Kozen

ISBN 10: 0387949070 / ISBN 13: 9780387949079

Published by Springer, Humana, 1997

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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 have already 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. Pushdown automata provide a broader class of models and enable 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.

Seller Inventory # 9780387949079

Bibliographic Details

• Title: Automata and Computability
• Publisher: Springer, Humana
• Publication Date: 1997
• Language: English
• ISBN 10: 0387949070
• ISBN 13: 9780387949079
• Binding: Buch
• Condition: Neu
• Dimensions: 260W x 183H x 29D millimeters 260 millimeters width by 183 millimeters height by 29 millimeters depth
• Weight: 983 grams

About this title

Synopsis

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 have already 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. Pushdown automata provide a broader class of models and enable 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.