Computability, Complexity, and Languages : Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) (2ND)

2,600.91 THB
ราคาสมาชิก
2,340.82
English

Product Description

Computability, Complexity, and Languages is an introductory text that 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.

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.

Available to Order

Usually dispatches within 3-4 weeks

While every attempt has been made to ensure stock availability, occasionally we may run out of stock at our stores.

จัดส่งฟรีในประเทศสำหรับยอดสั่งซื้อมากกว่า 1,200.00THB

Discount is applied at checkout.

Recently Viewed Items

Related Products