אנו משתמשים ב-Cookies כדי לשפר את החוויה שלך. כדי לקיים ההנחיה החדשה של e-Privacy, עלינו לבקש את הסכמתך להגדיר את ה-Cookies. קבלת מידע נוסף.
332.00 ₪
Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science
332.00 ₪
ISBN13
9780122063824
זמן אספקה
במלאי, (זמן אספקה 5 ימי עסקים)
תאריך יציאה לאור
18 במרץ 1994
שם סדרה
Computer Science and Scientific Computing
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.
This introductory text 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.
ISBN10 | 0122063821 |
---|---|
תאריך יציאה לאור | 18 במרץ 1994 |
זמן אספקה | במלאי, (זמן אספקה 5 ימי עסקים) |
Login and Registration Form