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...
Αποθηκεύτηκε σε:
| Κύριος συγγραφέας: | Kozen, Dexter |
|---|---|
| Μορφή: | Βιβλίο |
| Γλώσσα: | 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ơ |
|---|
Παρόμοια τεκμήρια
-
An introduction to formal languages and automata
ανά: Linz, Peter
Έκδοση: (2012) -
Automata and Computability
ανά: Kozen, Dexter C
Έκδοση: (1997) -
Finite automata
ανά: Mark V. Lawson
Έκδοση: (2004) -
Semigroups, algorithms, automata, and languages :
Έκδοση: (2002) -
Introduction to automata theory, language, and computation
ανά: Hopcroft, John E.
Έκδοση: (2007)