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.
Saved in:
| Main Author: | Martin, John C. |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New York :
McGraw-Hill,
1997.
|
| Edition: | 2nd ed. |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institutions: | Mạng thư viện Đại học Đà Nẵng |
|---|
Similar Items
-
Introduction to languages and the theory of computation
by: Martin, John C. -
Introduction to languages and the theory of computation
by: Martin, John C. -
Introduction to languages and the theory of computation /
by: Martin, John C.
Published: (2011) -
Introduction to languages and the theory of computation
by: John Martin
Published: (2003) -
Introduction to languages and the theory of computation
by: Martin, John C.
Published: (2011)


