Introducing the theory of computation
Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Fformat: | Llyfr |
| Iaith: | Undetermined |
| Cyhoeddwyd: |
Sudbury, Mass.
Jones and Bartlett Publishers
2008
|
| Pynciau: | |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| LEADER | 00888nam a2200193Ia 4500 | ||
|---|---|---|---|
| 001 | CTU_194844 | ||
| 008 | 210402s9999 xx 000 0 und d | ||
| 082 | |a 511.35 | ||
| 082 | |b G578 | ||
| 100 | |a Goddard, Wayne | ||
| 245 | 0 | |a Introducing the theory of computation | |
| 245 | 0 | |c Wayne Goddard. | |
| 260 | |a Sudbury, Mass. | ||
| 260 | |b Jones and Bartlett Publishers | ||
| 260 | |c 2008 | ||
| 520 | |a Introducing the Theory of Computation is the ideal text for an undergraduate course in the Theory of Computation or Automata Theory. The text covers the standard three models of finite automata, grammars, and Turing machines, as well as undecidability and an introduction to complexity theory | ||
| 650 | |a Machine theory.,Computational complexity.,Độ phức tạp của máy điện toán | ||
| 904 | |i Tuyến | ||
| 980 | |a Trung tâm Học liệu Trường Đại học Cần Thơ | ||