Introduction to Computer Theory
Autor Daniel I. A. Cohen, James Ed. Cohen, James Ed Cohenen Limba Engleză Paperback – 11 oct 1996
Preț: 1483.42 lei
Preț vechi: 2032.08 lei
-27%
Puncte Express: 2225
Carte tipărită la comandă
Livrare economică 19 octombrie-02 noiembrie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9780471137726
ISBN-10: 0471137723
Pagini: 652
Dimensiuni: 178 x 254 x 35 mm
Greutate: 1.21 kg
Ediția:2. Auflage
Editura: Wiley
Locul publicării:Hoboken, United States
ISBN-10: 0471137723
Pagini: 652
Dimensiuni: 178 x 254 x 35 mm
Greutate: 1.21 kg
Ediția:2. Auflage
Editura: Wiley
Locul publicării:Hoboken, United States
Public țintă
Computer Scientists, Students and Professors.Notă biografică
Daniel Isaac Aryeh Cohen is an American mathematician and computer scientist who is now a professor emeritus at Hunter College.
Cuprins
AUTOMATA THEORY.
Background.
Languages.
Recursive Definitions.
Regular Expressions.
Finite Automata.
Transition Graphs.
Kleene's Theorem.
Finite Automata with Output.
Regular Languages.
Nonregular Languages.
Decidability.
PUSHDOWN AUTOMATA THEORY.
Context-Free Grammars.
Grammatical Format.
Pushdown Automata.
CFG = PDA.
Non-Context-Free Languages.
Context-Free Languages.
Decidability.
TURING THEORY.
Turing Machines.
Post Machines.
Minsky's Theorem.
Variations on the TM.
TM Languages.
The Chomsky Hierarchy.
Computers.
Bibliography.
Indexes.
Background.
Languages.
Recursive Definitions.
Regular Expressions.
Finite Automata.
Transition Graphs.
Kleene's Theorem.
Finite Automata with Output.
Regular Languages.
Nonregular Languages.
Decidability.
PUSHDOWN AUTOMATA THEORY.
Context-Free Grammars.
Grammatical Format.
Pushdown Automata.
CFG = PDA.
Non-Context-Free Languages.
Context-Free Languages.
Decidability.
TURING THEORY.
Turing Machines.
Post Machines.
Minsky's Theorem.
Variations on the TM.
TM Languages.
The Chomsky Hierarchy.
Computers.
Bibliography.
Indexes.
Descriere
This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.