Mohlo by se vám také líbit

Více informací o knize Computability, Complexity, and Languages

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 243 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: Computability, Complexity, and Languages
• Podnázev: Fundamentals of Theoretical Computer Science
• Autor: Martin Davis, Ron Sigal, Elaine J. Weyuker
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 609
• EAN: 9780122063824
• ISBN: 0122063821
• ID: 04493274
• Nakladatelství: Elsevier Science & Technology
• Hmotnost: 1062 g
• Rozměry: 236 × 162 × 48 mm
• Datum vydání: 18. March 1994

Oblíbené z jiného soudku

---

---

---