Appropriate for upper division undergraduate and graduate level courses in Computer Science Theory, Theory of Computation, and Automata and Formal Language Theory.
This book focuses on fundamental issues of computation. The readers can master the content and gain lasting perspective from which to understand computers by carefully worked out examples, illustrations, and algorithmic proofs. It is especially appropriate for one-term courses.
"synopsis" may belong to another edition of this title.
Book Description Book Condition: Brand New. PAPERBACK,Book Condition New, Brand New, Softcover, International Edition. We Do not Ship APO FPO AND PO BOX.NOT LOOSE LEAF VERSION,NO SOLUTION MANUAL, NO CD, NO ACCESS CARD Cover Image & ISBN may be different from US edition but contents as US Edition. Printing in English language. Quick delivery by USPS/UPS/DHL/FEDEX/ARAMEX ,Customer satisfaction guaranteed. We may ship the books from Asian regions for inventory purpose. Bookseller Inventory # ABEJULNAD610
Book Description Paperback. Book Condition: New. New Softcover International Edition, Printed in Black and White, Different ISBN, Same Content As US edition, Book Cover may be Different, in English Language. Bookseller Inventory # 17385
Book Description Pearson. Soft cover. Book Condition: New. International Edition. 0130279617 Brand New Book. Premium International Edition with Same Contents. Fast Delivery. Bookseller Inventory # INDSKT-9788131766392
Book Description Pearson 2000-06-23, 2000. Hardcover. Book Condition: New. 0130279617 BRAND NEW. PLASTIC WRAPPED. Over 1,000,000 satisfied customers since 1997! We ship daily M-F. Choose expedited shipping (if available) for much faster delivery. Delivery confirmation on all US orders. Bookseller Inventory # Z0130279617ZN
Book Description Pearson. Book Condition: New. 0130279617 Orders ship same or next business day w/ free tracking. Choose Expedited shipping for fastest (2-6 business day) delivery. Satisfaction Guaranteed. Bookseller Inventory # Z0130279617ZN
Book Description Pearson. Book Condition: New. 0130279617 Hardcover. New. Never opened. Receive your book within 1-4 business days! International shipping available. We do not ship to PO Box/APO/FPO addresses. Bookseller Inventory # 0130279617-11
Book Description Pearson. Hardcover. Book Condition: New. 0130279617 New Condition. Bookseller Inventory # NEW4.0043140
Book Description Pearson, 2000. Book Condition: New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: (NOTE: Each chapter concludes with Exercises.) 1. Introduction. Why Study the Theory of Computing? What Is Computation? The Contents of This Book. Mathematical Preliminaries. 2. Finite Automata. Deterministic Finite Automata. Nondeterministic Finite Automata. Determinism versus Nondeterminism. Regular Expressions. Nonregular Languages. Algorithms for Finite Automata. The State Minimization Problem. 3. Context Free Languages. Context-Free Grammars. Parsing. Pushdown Automata. Languages and Automata. Closure Properties. Languages That Are Not Context-Free. Chomsky Normal Form. Determinism. 4. Turing Machines. Definition of a Turing Machine. Computations by Turing Machines. Extensions of Turing Machines. Nondeterministic Turing Machines. Turing Enumerable Languages. 5. Undecidability. The Church-Turing Thesis. Universal Turing Machines. The Halting Problem. Undecidable Problems. 6. Computational Complexity. The Definition and the Class P. The Class N P. N P-Completeness. References. List of Symbols. Index. Bookseller Inventory # ABE_book_new_0130279617
Book Description Paperback. Book Condition: BRAND NEW. BRAND NEW. Fast Shipping. Prompt Customer Service. Satisfaction guaranteed. Bookseller Inventory # 0130279617BNA
Book Description Pearson, 2000. Paperback. Book Condition: New. book. Bookseller Inventory # 0130279617