| 000 | 01249 a2200229 4500 | ||
|---|---|---|---|
| 999 |
_c739 _d739 |
||
| 005 | 20200923160414.0 | ||
| 008 | 190118b ||||| |||| 00| 0 eng d | ||
| 020 | _a9780070499393 | ||
| 020 | _a007049939X | ||
| 040 |
_b0 _c0 |
||
| 082 |
_a004.519 _bMAR |
||
| 100 | _a Martin, John C. | ||
| 245 | _aIntroduction to Languages and the Theory of Computation | ||
| 250 | _a3rd ed | ||
| 260 |
_aNew Delhi : _bMcGraw-Hill, _c©2003. |
||
| 300 |
_axiii, 543 pages : _billustrations ; _c24 cm |
||
| 505 |
_tPart.1 Mathematical Notation and Techniques -- _tPart.2 Regular Languages and Finite Automata -- _tPart.3 Context-Free Languages and Pushdown Automata -- _tPart.4 Turing Machines and Their Languages -- _tPart.5 Unsolvable Problems and Computable Functions -- _tPart.6 Introduction to Computational Complexity -- |
||
| 520 | _aProviding an introduction to the theory of computation, this work emphasizes formal languages, automata and abstract models of computation, and computability. It includes an introduction to computational complexity and NP-completeness. It also introduces the necessary mathematical tools in the context in which they are used. | ||
| 650 | _aComputable functions | ||
| 650 | _aSequential machine theory | ||
| 942 |
_cG _2ddc |
||