Description

Book Synopsis
Language theory, automata, and complexity theory are essential topics in the field of computer science. In this volume, two established experts offer practical, accessible coverage of these issues with an emphasis on problem-solving skills.

Trade Review
"Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text…" (IEEE Circuits & Devices, July/August 2004)

"...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)



Table of Contents
Preface.

Leverages.

Finite Automata.

Context-Free Languages.

Turing Machines.

Computability Theory.

Computational Complexity.

NP-Completeness.

References.

Index.

Problem Solving in Automata Languages and Comp

    Product form

    A Hardback by Ding-Zhu Du, Ker-I Ko

    £131.35

    Includes FREE delivery

    RRP £145.95 – you save £14.60 (10%)

    Order before 4pm on Wednesday for delivery by Fri 20 Nov 2026.

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Problem Solving in Automata Languages and Comp by Ding-Zhu Du

      Book details

      Publisher John Wiley & Sons Inc
      Published 24 October 2001
      ISBN-13 9780471439608
      978-0471439608
      ISBN-10 0471439606

      Description

      Book Synopsis
      Language theory, automata, and complexity theory are essential topics in the field of computer science. In this volume, two established experts offer practical, accessible coverage of these issues with an emphasis on problem-solving skills.

      Trade Review
      "Its notional richness, while challenging, when combined with the instructional narrative is quite engaging-I found myself drawn into the text…" (IEEE Circuits & Devices, July/August 2004)

      "...uses a problem-solving approach that makes these computer languages concrete..." (SciTech Book News, Vol. 25, No. 4, December 2001)



      Table of Contents
      Preface.

      Leverages.

      Finite Automata.

      Context-Free Languages.

      Turing Machines.

      Computability Theory.

      Computational Complexity.

      NP-Completeness.

      References.

      Index.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account