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

By: and and

Sign Up Now! Already a Member? Log In
You must be logged into UK education collection to access this title. Learn about membership options, or view our freely available titles.

Synopsis
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.
Copyright:
1994

Book Details

Book Quality:
Publisher Quality
Book Size:
609 Pages
ISBN-13:
9780080502465
Related ISBNs:
9780122063824, 9781493300341
Publisher:
Morgan Kaufmann Publishers
Date of Addition:
Copyrighted By:
Elsevier Science & Technology
Adult content:
No
Language:
English
Has Image Descriptions:
No
Categories:
Nonfiction, Computers and Internet, Mathematics and Statistics
Submitted By:
Bookshare Staff
Usage Restrictions:
This is a copyrighted book.

Reviews

No Rating Yet