Automaten und Berechenbarkeit (Undergraduate Texts in Computer Science) [gebunden]
117,65 €
The first part of the book is devoted to finite automata and their properties. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Godel's incompleteness theorems.
Jetzt bei Ebay:
![Produktbild - Beginning Functional Analysis (Undergraduate Texts in Mathematics) [Hardback]](https://i.ebayimg.com/thumbs/images/g/a9cAAeSw8vtoPmBh/s-l140.jpg)
![Produktbild - Applied Scientific Computing: With Python (Texts in Computer Science) [Hardback]](https://i.ebayimg.com/thumbs/images/g/JgYAAeSwwlxoPHJ6/s-l140.jpg)
![Produktbild - Basic Graph Theory: 2017 (Undergraduate Topics in Computer Science) [Hardback]](https://i.ebayimg.com/thumbs/images/g/~gkAAeSwvR9oOmaB/s-l140.jpg)
![Produktbild - Notes on Set Theory (Undergraduate Texts in Mathematics) [Paperback] NEUF](https://i.ebayimg.com/thumbs/images/g/fdIAAeSwjlZoPmCn/s-l140.jpg)
