Automata and computability
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader cla...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | ספר |
| שפה: | Undetermined |
| יצא לאור: |
New York
Springer
1997
|
| נושאים: | |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|