Buch, Englisch, 656 Seiten, Format (B × H): 178 mm x 253 mm, Gewicht: 1107 g
ISBN: 978-0-471-13772-6
Verlag: Wiley
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." The goal of the book is to provide a firm understanding of the principles and the big picture of where computer theory fits into the field.
Autoren/Hrsg.
Weitere Infos & Material
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.




