computer books and technical books at discount prices
Advanced Search
View
My
0
Shopping
Bag
Home Login F.A.Q. Contact Us
 
My Myself and I:
 Order Tracking 
 My Wishlist 
 My Gift Registry 
 Change User Preferences 
 E-mail Notifications 

Browse Books:
 Bestsellers 
 New Arrivals 
 Bargain Computer Books 
 Classic Computer Books 

Browse Subjects:
 business & finance 
 business applications 
 cad/cam 
 certification 
 computing 
 databases 
 desktop publishing 
 engineering 
 gaming 
 geographic/gis 
 graphics/animation 
 groupware 
 internet 
 mathematics 
 microsoft programming 
 multimedia 
 networking 
 object-oriented 
 operating systems 
 other & misc 
 physics 
 programming languages 
 servers 
 web design/development 

Models of Computation and Formal Languages
by Taylor, R. Gregory
 

 
Cover Price: $87.95
Online Price: $83.55
You save $4.40 (5%)

 

ISBN-10: 019510983X
ISBN-13: 9780195109832
Publisher: Oxford University Press
Published August 1997; Hardcover; 667 pages
Add to Shopping Bag
 

OUT OF STOCK
0 COPIES
 
Add to Wishlist
Related categories:
All Sections > Programming Languages > General/Theory

Summary:
This unique book presents a comprehensive and rigorous treatment of the theory of computability which is introductory yet self-contained. It takes a novel approach by looking at the subject using computation models rather than a limitation orientation, and is the first book of its kind to include software. Accompanying software simulations of almost all computational models are available for use in conjunction with the text, and numerous examples are provided on disk in a user-friendly format. Its applications to computer science itself include interesting links to programming language theory, compiler design theory, and algorithm design. The software, numerous examples, and solutions make this book ideal for self-study by computer scientists and mathematicians alike.

Table of Contents:
Preface
Ch. 0Mathematical Preliminaries
Ch. 1Turing Machines
Ch. 2Additional Varieties of Turing Machines
Ch. 3An Introduction to Recursion Theory
Ch. 4Markov Algorithms
Ch. 5Register Machines
Ch. 6Post Systems (Optional)
Ch. 7The Vector Machine Model of Parallel Computation (Optional)
Ch. 8The Bounds of Computability
Ch. 9Regular Languages and Finite-State Automata
Ch. 10Context-Free Languages and Pushdown-Stack Automata
Ch. 11Context-Sensitive Languages and Linear-Bounded Automata
Ch. 12Generative Grammars and the Chomsky Hierarchy
Epilogue
Bibliography
Index


Related titles:
Concepts of Programming Languages, 10th EditionElements of ProgrammingThe Art of Computer Programming: Generating All Tuples and Permutations, Volume 4, Fascicle 2