We a good story
Quick delivery in the UK
About Computability, Complexity, and Languages

Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.

Show more
  • Language:
  • English
  • ISBN:
  • 9780122063824
  • Binding:
  • Paperback
  • Pages:
  • 609
  • Published:
  • March 17, 1994
  • Edition:
  • 2
  • Dimensions:
  • 162x236x48 mm.
  • Weight:
  • 1018 g.
Delivery: 1-2 weeks
Expected delivery: January 4, 2025
Extended return policy to January 30, 2025
  •  

    Cannot be delivered before Christmas.
    Buy now and print a gift certificate

Description of Computability, Complexity, and Languages

Covers the key areas of computer science, including recursive function theory, formal languages, and automata. This book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability. It also covers in a variety of different arrangements automata theory, computational logic, and complexity theory.

User ratings of Computability, Complexity, and Languages



Find similar books
The book Computability, Complexity, and Languages can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.