• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • 'Language is english. Váltás magyarra.'
    Wishlist
    Introduction to Languages the Theory of Computation

    Introduction to Languages the Theory of Computation by Martin, John;

      • GET 10% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice GBP 43.99
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        19 861 Ft (18 915 Ft + 5% VAT)
      • Discount 10% (cc. 1 986 Ft off)
      • Discounted price 17 875 Ft (17 024 Ft + 5% VAT)

    19 861 Ft

    Availability

    Uncertain availability. Please turn to our customer service.

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Edition number 3
    • Publisher McGraw-Hill Higher Education
    • Date of Publication 1 September 2002

    • ISBN 9780071198547
    • Binding Paperback
    • No. of pages pages
    • Size 228x177x23 mm
    • Weight 794 g
    • Language English
    • 0

    Categories

    Short description:

    This is an introduction for undergraduates to the theory of computation which emphasizes formal languages, automata, and abstract models of computation and computability. It also includes an introduction to computational complexity and NP-completeness.

    More

    Long description:

    Introduction to Languages and the Theory of Computation is an introduction to the theory of computation that emphasizes formal languages, automata and abstract models of computation, and computability; it also includes an introduction to computational complexity and NP-completeness. Through the study of these topics, students encounter profound computational questions and are introduced to topics that will have an ongoing impact in computer science. Once students have seen some of the many diverse technologies contributing to computer science, they can also begin to appreciate the field as a coherent discipline.



    A distinctive feature of this text is its gentle and gradual introduction of the necessary mathematical tools in the context in which they are used. Martin takes advantage of the clarity and precision of mathematical language but also provides discussion and examples that make the language intelligible to those just learning to read and speak it. The material is designed to be accessible to students who do not have a strong background in discrete mathematics, but it is also appropriate for students who have had some exposure to discrete math but whose skills in this area need to be consolidated and sharpened.

    More

    Table of Contents:

    I Mathematical Notation and Techniques

    1 Basic Mathematical Objects

    2 Mathematical Induction and Recursive Definitions

    II Regular Languages and Finite Automata

    3 Regular Languages and Finie Automata

    4 Nondeterminism and Kleene's Theorem

    5 Regular and Nonregular Languages

    III Context-Free Languages and Pushdown Automata

    6 Context-Free Grammars

    7 Pushdown Automata

    8 Context-Free and Non-Context-Free Languages

    IV Turing Machines and Their Languages

    9 Turing Machines

    10 Recursively Enumerable Languages

    V Unsolvable Problems and Computable Functions

    11 Unsolvable Problems

    12 Computable Functions

    VI Introduction to Computational Complexity

    13 Measuring and Classifying Complexity

    14 Tractable and Intractable Problems

    More

    0