• All Products
      • Paperback
      • Hardcover
      • eBook
      • Audiobook

    Computability, Complexity, and Languages

    By: Ron Sigal

    QTY
    -+
    $81.99
     
     
    ISBN
    9780080502465
    Date Released
    Binding
    eBook
     
     

    Instant Download

    Description
    This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability.* Computability theory is introduced in a manner that makes maximum use of previous programming experience, including a "universal" program that takes up less than a page.* The number of exercises included has more than tripled.* Automata theory, computational logic, and complexity theory are presented in a flexible manner, and can be covered in a variety of different arrangements.

    You might also like



    Accepted Payments
    QBD Proudly Supports

    Need help? Call us on (07) 3291 7444