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.
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | Knjiga |
| Jezik: | English |
| Izdano: |
New York :
McGraw-Hill,
1997.
|
| Izdanje: | 2nd ed. |
| Teme: | |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
| Thư viện lưu trữ: | Mạng thư viện Đại học Đà Nẵng |
|---|
| LEADER | 01383cam a2200373 a 4500 | ||
|---|---|---|---|
| 001 | 000046019 | ||
| 003 | 5285 | ||
| 005 | 20060605110943.0 | ||
| 008 | 010220b1997 vm 000 eng | ||
| 020 | |a 007115468X | ||
| 040 | |a IRC |c IRC |d IRC | ||
| 041 | 0 | |a eng | |
| 082 | 1 | 4 | |a 511.3 |b MA-J |
| 100 | 1 | |a Martin, John C. | |
| 245 | 1 | 0 | |a Introduction to languages and the theory of computation / |c John C. Martin. |
| 250 | |a 2nd ed. | ||
| 260 | |a New York : |b McGraw-Hill, |c 1997. | ||
| 300 | |a xiv, 450 p. : |b ill. ; |c 22.5 cm. | ||
| 520 | 3 | |a 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. | |
| 630 | 0 | 4 | |a Mathematics. |
| 650 | 0 | 4 | |a Sequential machine theory. |
| 650 | 0 | 4 | |a Computable functions. |
| OWN | |a DUT | ||
| AVA | |a UDN50 |b DUT |c Book |d 511.3 MA-J |e available |t Error 5001 Not defined in file expand_doc_bib_avail. |f 1 |g 0 |h N |i 0 |j SH |k 1 | ||
| 999 | |a From the UDN01 | ||
| AVA | |a UDN50 |b DUT |c Book |d 511.3 MA-J |e available |t Error 5001 Not defined in file expand_doc_bib_avail. |f 1 |g 0 |h N |i 0 |j SH |k 1 | ||
| TYP | |a Monograph | ||
| TYP | |a Printed language | ||
| 980 | |a Mạng thư viện Đại học Đà Nẵng | ||