Log in to track your reading progress.
Synopsis
Introduction -- Context-free Grammars -- Finite-state Acceptors -- Finite-state Transducers -- Turing Machines And Computable Functions -- Universal Turing Machines And The Halting Problem -- Turing Machines As Accepting Devices -- Nondeterministic Turing Machines -- Pushdown Automata -- Unsolvable Questions About Context-free Languages. Walter J. Savitch. Includes Indexes. Bibliography: P. 206-207.Book Details
Published
June 18, 1982
Publisher
Little, Brown
Pages
215
Format
Hardcover
ISBN
9780316771610