Introduction to languages and the theory of computation /
Mathematical notation and techniques; Regular languages and finite automata; Context-free languages and pushdown automata; Turing machines and their languages; Unsolvable probles and computable; Introduction to computational complexity.
Сохранить в:
| Главный автор: | Martin, John C. |
|---|---|
| Формат: | |
| Язык: | English |
| Опубликовано: |
New York :
McGraw-Hill,
1997.
|
| Редактирование: | 2nd ed. |
| Предметы: | |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
| Thư viện lưu trữ: | Mạng thư viện Đại học Đà Nẵng |
|---|
Схожие документы
-
Introduction to languages and the theory of computation
по: Martin, John C. -
Introduction to languages and the theory of computation
по: Martin, John C. -
Introduction to languages and the theory of computation /
по: Martin, John C.
Опубликовано: (2011) -
Introduction to languages and the theory of computation
по: John Martin
Опубликовано: (2003) -
Introduction to languages and the theory of computation
по: Martin, John C.
Опубликовано: (2011)


