Automata and computability

Rubriek: Textual/Printed/Reference Materials - Boek

Prijs: € 49.99

Rating: 0/5

☆

☆

☆

☆

☆

Verzending:
Uiterlijk 12 juli in huis

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. Pushdown automata provide a broader class of models and enable the analysis of context-free languages.



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.

• Bekijk alle specificaties

Taal: en

Bindwijze: Paperback

Oorspronkelijke releasedatum: 13 oktober 2012

Aantal pagina's: 400

Illustraties: Nee

Hoofdauteur: D Kozen

Tweede Auteur: Kozen

Co Auteur: Kozen, Dexter C.

Hoofduitgeverij: Springer

Editie: Softcover reprint of the original 1st ed. 1997

Extra groot lettertype: Nee

Product breedte: 155 mm

Product hoogte: 22 mm

Product lengte: 235 mm

Studieboek: Ja

Verpakking breedte: 156 mm

Verpakking hoogte: 25 mm

Verpakking lengte: 230 mm

Verpakkingsgewicht: 286 g

EAN: 9781461273097

---