Introduction To Languages And The Theory Of Computation (SIE) 3rd  Edition

Introduction To Languages And The Theory Of Computation (SIE) 3rd Edition (English, Paperback, John Martin)

Share

Introduction To Languages And The Theory Of Computation (SIE) 3rd Edition  (English, Paperback, John Martin)

4.3
39 Ratings & 3 Reviews
₹500
599
16% off
Hurry, Only 1 left!
  • Bank OfferExtra 5% off* with Axis Bank Buzz Credit Card
    T&C
  • Delivery
    Check
    Enter pincode
      Usually delivered in4-5 days
      ?
      Enter pincode for exact delivery dates/charges
    View Details
    Author
    Read More
    Highlights
    • Language: English
    • Binding: Paperback
    • Publisher: Mcgraw Higher Ed
    • ISBN: 9780070660489, 0070660484
    • Edition: 3rd Edition, 2009
    • Pages: 560
    Services
    • 10 Days Replacement Policy
      ?
    • Cash on Delivery available
      ?
    Seller
    Description

    This textbook by John C. Martin enables students to grasp all the essential concepts of the theory of computation while ensuring the connection to practical computer science applications. This edition comes with around 750 unsolved and solved problems.

    Summary Of The Book

    The world of computation is much more than the 'input-processing-output' definition. And for all those students embarking on a deeper quest of computing knowledge, Introduction To Languages And The Theory Of Computation is a comprehensive guide to understand the basics of computing theory and languages. It highlights computability, abstract models of computation, automata, and formal languages. An understanding of these topics helps kindle more interesting questions in students, as an answer to which, the author brings out further material addressing various technologies that have continuing effects on real-world computation.

    This induction to the basics of the languages and the theory of computation is done in 6 parts that consist of 14 chapters altogether. The book starts with two chapters on Mathematical Notation and Techniques and continues to cover various topics like regular languages, context free languages, pushdown automata and classifying complexity. It also provides an introduction to NP-completeness and computational complexity.

    The gradual and gentle introduction to the required mathematical tools which prepares students for the other chapters is a highlight of the book.

    The author uses the precision and clarity of the language of mathematics to help students absorb the subject better. He also provides a lot of examples and discussions to make it comprehensible for beginners and even those who are looking to brush up their skills.

    All the chapters, like in the previous editions of the book, are explained in a very detailed manner and are organized well in keeping with the flow of the subject matter. Martin has made it easy for the instructors too by including an ample amount of exercises, both solved and unsolved. And, there are a number of challenging problems that demand keen understanding of the text's theoretic content. These aid the students in working with the fundamental concepts taught in the book.

    About John C. Martin 

    John C. Martin is an American professor.

    He is a Mathematics graduate from Rice University. He also holds a Ph.D and has taught at the University of Hawaii for 2 years. He currently works as an associate professor at the North Dakota State University where he teaches computer science.

    Read More
    Specifications
    Book Details
    Publication Year
    • 2009
    Table of Contents
    • Preface
      Introduction

      PART 1: Mathematical Notation and Techniques

      Chapter 1: Basic Mathematical Objects
      Chapter 2: Mathematical Induction and Recursive Definitions

      PART II: Regular Languages and Finite Automata

      Chapter 3: Regular Expressions and Finite Automata
      Chapter 4: Nondeterminism and Kleene?s Theorem
      Chapter 5: Regular and Nonregular Languages

      PART III: Context- Free Languages and Pushdown Automata

      Chapter 6: Context-Free Grammars
      Chapter 7: Pushdown Automata
      Chapter 8: Context-Free and Non-Context- Free Languages

      PART IV: Turning Machines and Their Languages

      Chapter 9: Turning Machines
      Chapter 10: Recursively Enumerable Languages

      PART V: Unsolvable Problems and Computable Functions

      Chapter 11: Unsolved Problems
      Chapter 12: Computable Functions

      PART VI: Introduction and Classifying Complexity

      Chapter 13: Measuring and Classifying Complexity
      Chapter 14: Tractable and Intractable Problems
      References
      Bibliography
      Index of Notation
      Index

    Contributors
    Author
    • John Martin
    University Books Details
    Specialization
    • B.Sc(Computer Science), Computer Science Engineering, Computer Science Engineering
    Term
    • 4th Semester, 5th Semester
    Frequently Bought Together
    Ratings & Reviews
    4.3
    39 Ratings &
    3 Reviews
    • 5
       21
    • 4
       11
    • 3
       5
    • 2
       0
    • 1
       2
    5

    Good book

    This is a standard text used by many universities across the globe. I was comparing this with Sipser and Ullman's books. Overall, I find this to have the best presentation and lots of examples. The typesetting is also nice with good mix of bold and italic fonts. Flipkart delivered it in a day with excellent packing!
    READ MORE

    Venkatesh Vinayakarao

    Certified Buyer, Hyderabad

    16 Dec, 2014

    2
    0
    Report Abuse
    5

    Worth every penny

    The book was new and good.
    READ MORE

    Priyanka Sundaram

    Certified Buyer, Coimbatore

    20 Jun, 2017

    0
    0
    Report Abuse
    5

    Must buy!

    Good book to learn toc
    READ MORE

    bhargav dave

    Certified Buyer, Nadiad

    14 May, 2017

    0
    0
    Report Abuse
    Have doubts regarding this product?
    Safe and Secure Payments.Easy returns.100% Authentic products.
    Back to top