Elaine J. Weyuker – författare
Visar alla böcker från författaren Elaine J. Weyuker. Handla med fri frakt och snabb leverans.
5 produkter
5 produkter
E-bok
Engelska, 1994670 kr
Läs direkt efter köp
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.- 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.
Häftad, Engelska, 1994
684 kr
Skickas inom 10-15 vardagar
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. 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.
Inbunden, Engelska, 2015
398 kr
Skickas inom 3-6 vardagar
Häftad, Engelska, 2018
246 kr
Skickas inom 3-6 vardagar
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science provides an introduction to the various aspects of theoretical computer science. Theoretical computer science is the mathematical study of models of computation. This text is composed of five parts encompassing 17 chapters, and begins with an introduction to the use of proofs in mathematics and the development of computability theory in the context of an extremely simple abstract programming language. The succeeding parts demonstrate the performance of abstract programming language using a macro expansion technique, along with presentations of the regular and context-free languages. Other parts deal with the aspects of logic that are important for computer science and the important theory of computational complexity, as well as the theory of NP-completeness. The closing part introduces the advanced recursion and polynomial-time computability theories, including the priority constructions for recursively enumerable Turing degrees. This book is intended primarily for undergraduate and graduate mathematics students.