Mohlo by sa vám tiež páčiť

Viac informácií o knihe Computability, Complexity, and Languages

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 252 bodov

Anotácia 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.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Mathematical theory of computation

• Celý názov: Computability, Complexity, and Languages
• Podnázov: Fundamentals of Theoretical Computer Science
• Autor: Martin Davis, Ron Sigal, Elaine J. Weyuker
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 609
• EAN: 9780122063824
• ISBN: 0122063821
• ID: 04493274
• Nakladateľ: Elsevier Science & Technology
• Hmotnosť: 1062 g
• Rozmery: 236 × 162 × 48 mm
• Dátum vydania: 18. March 1994

Obľúbené z iného súdka

---

---

---