close menu
Bookswagon-24x7 online bookstore
close menu
My Account
Home > Computing and Information Technology > Computer science > Languages and Machines: An Introduction to the Theory of Computer Science
Languages and Machines: An Introduction to the Theory of Computer Science

Languages and Machines: An Introduction to the Theory of Computer Science

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist
X

About the Book

Languages and Machines gives a mathematically sound presentation of the theory of computing at the junior and senior level and is an invaluable tool for scientists investigating the theoretical foundations of computer science. Topics covered include the theory of formal languages and automata, computability, computational complexity, and deterministic parsing of context-free languages. No special mathematical prerequisites are assumed; the theoretical concepts and associated mathematics are made accessible by a 'learn as you go' approach that develops an intuitive understanding of the concepts through numerous examples and illustrations. Languages & Machines examines the languages of the Chomsky hierarchy, the grammars that generate them, and the finite automata that accept them. Sections on the Church-Turing thesis and computability theory further examine the development of abstract machines. Computational complexity and NP-completeness are introduced by analyzing the computations of Turing machines. Parsing with LL and LR grammars is included to emphasize language definition and to provide the groundwork for the study of compiler design. Features *A winning writing style, Languages and Machines is becoming recognized as an instructor's boon *Effective examples that convey challenging and complex theoretical concepts *Numerous diagrams illustrating pictorially the underlying concepts *Step-by-step, unhurried proofs *A "learn as you go" approach that develops mathematical sophistication Features New to this Edition: *DFA minimization *Rice's Theorem *Increased coverage of computational complexity *Additional examples throughout *Over 150 additional exercises ** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at http://hepg.awl.com/rep-locator. 0201821362B04062001

Table of Contents:
Introduction. I. FOUNDATIONS. 1. Mathematical Preliminaries. Set Theory. Cartesian Product, Relations, and Functions. Equivalence Relations. Countable and Uncountable Sets. Recursive Definitions. Mathematical Induction. Directed Graphs. Exercises. Bibliographic Notes. 2. Languages. Strings and Languages. Finite Specification of Languages. Regular Sets and Expressions. Exercises. Bibliographic Notes. II. CONTEXT-FREE GRAMMARS AND PARSING. 3. Context-Free Grammars. Context-Free Grammars and Languages. Examples of Grammars and Languages. Regular Grammars. Grammars and Languages Revisited. A Context-Free Grammar for Pascal. Arithmetic Expressions. Exercises. Bibliographic Notes. 4. Parsing: An Introduction. Leftmost Derivations and Ambiguity. The Graph of a Grammar. A Breadth-First Top-Down Parser. A Depth-First Top-Down Parser. Bottom-Up Parsing. A Shift-Reduce Parser. Exercises. Bibliographic Notes. 5. Normal Forms. Elimination of Lambda Rules. Elimination of Chain Rules. Useless Symbols. Chomsky Normal Form. Removal of Direct Left Recursion. Greibach Normal Form. Exercises. Bibliographic Notes. III. AUTOMATA AND LANGUAGES. 6. Finite Automata. A Finite-State Machine. Deterministic Finite Automata. State Diagrams and Examples. Nondeterministic Finite Automata. Lambda Transitions. Removing Nondeterminism. DFA Minimization. Exercises. Bibliographic Notes. 7. Regular Languages and Sets. Finite Automata and Regular Sets. Expression Graphs. Regular Grammars & Finite Automata. Closure Properties of Regular Languages. A Nonregular Language. The Pumping Lemma for Regular Languages. Myhill-Nerode Theorem. Exercises. Bibliographic Notes. 8. Pushdown Automata and Context-Free Languages. Variations on the PDA Theme. Pushdown Automaton and Context-Free Languages. The Pumping Lemma for Context-Free Languages. Closure Properties of Context-Free Languages. A Two-Stack Automation. Exercises. Bibliographic Notes. 9. Turing Machines. The Standard Turing Machine. Turing Machines as Language Acceptors. Alternate Acceptance Criteria. Multitrack Machines. Two-Way Tape. Multitape Machines. Nondeterministic Turing Machines. Turing Machines as Language Enumerators. Exercises. Bibliographic Notes. 10. The Chomsky Hierarchy. Unrestricted Grammars. Context-Sensitive Grammars. Linear-Bounded Automata. The Chomsky Hierarchy. Exercises. Bibliographic Notes. IV. DECIDABILITY AND COMPUTABLITY. 11. Decidability. Decision Problems. The Church-Turing Thesis. The Halting Problem for Turing Machines. A Universal Machine. Reducibility. Rice's Theorem. An Unsolvable Word Problem. The Post Correspondence Problem. Undecidable Problems in Context- Free Grammars. Exercises. Bibliographic Notes. 12. Numeric Computation. Computation of Functions. Sequential Operation of Turing Machines. Composition of Functions. Toward a Programming Languages. Exercises. Bibliographic Notes. 13. Mu-Recursive Functions. Primitive Recursive Functions. Some Primitive Recursive Functions. Bounded Operators. Division Functions. Gödel Numbering and Course-of-Values Recursion. Computable Partial Functions. Turing Computability and Mu-Recursive Functions. The Church-Turing Thesis Revisited. Exercises. Bibliographic Notes. V. COMPUTATIONAL COMPLEXITY. 14. Computational Complexity. Time Complexity of a Turing Machine. Linear Speed-Up. Rates of Growth. Complexity and Turing Machine Variations. Variations of Time Complexity. Nondeterministic Complexity. Space Complexity. Exercises. Bibliographic Notes. 15. Tractability and NP-Complete Problems. Tractable and Intractable Decision Problems. The Class NP. P=NP. The Satisfiability Problem. Additional NP-Complete Problems. Derivative Complexity Classes. Exercises. Bibliographic Notes. VI. DETERMINISTIC PARSING. 16. LL (k) Grammars. Lookahead in Context-Free Grammars. FIRST, FOLLOW, and Lookahead Sets. Strong LL (k) Grammars. Construction of FIRSTk Sets. Construction of FOLLOWk Sets. A Strong LL(1) Grammar. A Strong LL(k) Parser. LL(k) Grammars. Exercises. Bibliographic Notes. 17. LR(k) Grammars. LR(0) Contexts. LR(0) Parser. LR(0) Machine. Acceptance by the LR(0) Machine. Acceptance by the LR(p) Machine. LR(1) Grammars. Exercises. Bibliographic Notes. 0201821362T04062001


Best Sellers



Product Details
  • ISBN-13: 9780201821369
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 240 mm
  • No of Pages: 500
  • Sub Title: An Introduction to the Theory of Computer Science
  • Width: 242 mm
  • ISBN-10: 0201821362
  • Publisher Date: 03 Jan 1997
  • Binding: Hardback
  • Language: English
  • Spine Width: 29 mm
  • Weight: 906 gr


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Languages and Machines: An Introduction to the Theory of Computer Science
Pearson Education (US) -
Languages and Machines: An Introduction to the Theory of Computer Science
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Languages and Machines: An Introduction to the Theory of Computer Science

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA