Paperback. Pub Date: 2009 Pages: 609 Language: English in Publisher: People's Posts and Telecommunications Press calculate the theoretical basis of computability complexity and languages ??(English. 2nd edition) is a masterpiece in the field of theoretical computer science. Introduction to Computer Science core theme textbook. The book is divided into computability. grammar and automata. logic complexity and semantics of the five parts. about computability theory. formal language. logic and automatic deduction. computable complexity (including the NP-complete problem ) and the semantics of the programming language and other topics. and show how they are interrelated. Calculate the theoretical basis of computability complexity and languages ??(English. 2nd edition) is ideal for higher grades of computers and related professional undergraduate and postgraduate teaching referen...
"synopsis" may belong to another edition of this title.
Seller: liu xing, Nanjing, JS, China
paperback. Condition: New. Paperback. Pub Date: 2009 Pages: 609 Language: English in Publisher: People's Posts and Telecommunications Press calculate the theoretical basis of computability complexity and languages ??(English. 2nd edition) is a masterpiece in the field of theoretical computer science. Introduction to Computer Science core theme textbook. The book is divided into computability. grammar and automata. logic complexity and semantics of the five parts. about computability theory. formal language. logic and a. Seller Inventory # CB079489