DIA Cohen
John Wiley & Sons
2e druk, 1996
9780471137726
Introduction to Computer Theory 2e (WSE)
Specificaties
Paperback, 656 blz.
|
Engels
John Wiley & Sons |
2e druk, 1996
ISBN13: 9780471137726
Rubricering
Verwachte levertijd ongeveer 9 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9780471137726
Taal:Engels
Bindwijze:paperback
Aantal pagina's:656
Uitgever:John Wiley & Sons
Druk:2
Hoofdrubriek:Automatisering algemeen, Computer en informatica
Inhoudsopgave
AUTOMATA THEORY.
<br />
<br /> Background.
<br />
<br /> Languages.
<br />
<br /> Recursive Definitions.
<br />
<br /> Regular Expressions.
<br />
<br /> Finite Automata.
<br />
<br /> Transition Graphs.
<br />
<br /> Kleene′s Theorem.
<br />
<br /> Finite Automata with Output.
<br />
<br /> Regular Languages.
<br />
<br /> Nonregular Languages.
<br />
<br /> Decidability.
<br />
<br /> PUSHDOWN AUTOMATA THEORY.
<br />
<br /> Context–Free Grammars.
<br />
<br /> Grammatical Format.
<br />
<br /> Pushdown Automata.
<br />
<br /> CFG = PDA.
<br />
<br /> Non–Context–Free Languages.
<br />
<br /> Context–Free Languages.
<br />
<br /> Decidability.
<br />
<br /> TURING THEORY.
<br />
<br /> Turing Machines.
<br />
<br /> Post Machines.
<br />
<br /> Minsky′s Theorem.
<br />
<br /> Variations on the TM.
<br />
<br /> TM Languages.
<br />
<br /> The Chomsky Hierarchy.
<br />
<br /> Computers.
<br />
<br /> Bibliography.
<br />
<br /> Indexes.
<br />
<br /> Background.
<br />
<br /> Languages.
<br />
<br /> Recursive Definitions.
<br />
<br /> Regular Expressions.
<br />
<br /> Finite Automata.
<br />
<br /> Transition Graphs.
<br />
<br /> Kleene′s Theorem.
<br />
<br /> Finite Automata with Output.
<br />
<br /> Regular Languages.
<br />
<br /> Nonregular Languages.
<br />
<br /> Decidability.
<br />
<br /> PUSHDOWN AUTOMATA THEORY.
<br />
<br /> Context–Free Grammars.
<br />
<br /> Grammatical Format.
<br />
<br /> Pushdown Automata.
<br />
<br /> CFG = PDA.
<br />
<br /> Non–Context–Free Languages.
<br />
<br /> Context–Free Languages.
<br />
<br /> Decidability.
<br />
<br /> TURING THEORY.
<br />
<br /> Turing Machines.
<br />
<br /> Post Machines.
<br />
<br /> Minsky′s Theorem.
<br />
<br /> Variations on the TM.
<br />
<br /> TM Languages.
<br />
<br /> The Chomsky Hierarchy.
<br />
<br /> Computers.
<br />
<br /> Bibliography.
<br />
<br /> Indexes.