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.

Kaydedildi:
Detaylı Bibliyografya
Yazar: Martin, John C.
Materyal Türü: Kitap
Dil:English
Baskı/Yayın Bilgisi: New York : McGraw-Hill, 1997.
Edisyon:2nd ed.
Konular:
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
Thư viện lưu trữ: Mạng thư viện Đại học Đà Nẵng