| dc.contributor.advisor | Michael Sipser. | en_US |
| dc.contributor.author | Gillman, David Wallace | en_US |
| dc.date.accessioned | 2005-06-02T14:15:25Z | |
| dc.date.available | 2005-06-02T14:15:25Z | |
| dc.date.copyright | 1993 | en_US |
| dc.date.issued | 1993 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/17332 | |
| dc.description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1993. | en_US |
| dc.description | Includes bibliographical references (p. 122-130). | en_US |
| dc.description.statementofresponsibility | by David Gillman. | en_US |
| dc.format.extent | 130 p. | en_US |
| dc.format.extent | 5926188 bytes | |
| dc.format.extent | 5925996 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
| dc.subject | Mathematics | en_US |
| dc.title | Hidden Markov chains : convergence rates and the complexity of inference | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | Ph.D. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
| dc.identifier.oclc | 29943299 | en_US |
