Automata and Computability (inbunden)
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
413
Utgivningsdatum
2007-07-01
Upplaga
1st. ed. 1997. Corr. 8th printing.
Förlag
SPRINGER
Illustratör/Fotograf
Mit AbbUTab
Illustrationer
Ill.
Dimensioner
243 x 183 x 32 mm
Vikt
940 g
Antal komponenter
1
Komponenter
HC runder Rücken kaschiert
ISBN
9780387949079
Automata and Computability (inbunden)

Automata and Computability

av D Kozen
Inbunden Engelska, 2007-07-01
713
Skickas inom 5-8 vardagar.
Gratis frakt inom Sverige över 159 kr för privatpersoner.
Finns även som
Visa alla 4 format & utgåvor
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. 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 analyses of effective computability, decidability, and Gdel's incompleteness theorems. 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.
Visa hela texten

Passar bra ihop

  1. Automata and Computability
  2. +
  3. Theory of Computation: Classical & Contemporary Approaches

De som köpt den här boken har ofta också köpt Theory of Computation: Classical & Contemporary... av D Kozen (häftad).

Köp båda 2 för 1752 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av D Kozen

Innehållsförteckning

Introduction * Finite Automata and Regular Sets * Pushdown Automata and Context-Free Languages * Turing Machines and Effective Computability * Homework Sets * Miscellaneous Exercises * Hints and Solutions