| dc.contributor.author | Sipser, Michael | |
| dc.date.accessioned | 2015-09-02T00:38:01Z | |
| dc.date.available | 2015-09-02T00:38:01Z | |
| dc.date.issued | 2006 | |
| dc.identifier.citation | Australia : Thomson Course Technology, 2006 | en_US |
| dc.identifier.isbn | 0-534-95097-3 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/572 | |
| dc.description.abstract | This highly anticipated revision builds upon the strengths of the previous edition. Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Thomson Course Technology | en_US |
| dc.subject | Machine theory | en_US |
| dc.subject | Computational complexity | en_US |
| dc.title | Introduction to the theory of computation | en_US |
| dc.type | Book | en_US |
