|
Textbook
Introduction to Computer Theory, 2nd EditionISBN: 978-0-471-13772-6
Paperback
648 pages
October 1996, ©1997
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 10-15 days delivery time. The book is not returnable.
|
||||||
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.
Related Titles
Special Topics
Resources for
Instructors
Contact a Wiley Sales Rep
Find Your Rep
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
