2026-09-19T21:52:55Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/173322022-01-13T07:54:34Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Michael Sipser.
Gillman, David Wallace
Massachusetts Institute of Technology. Department of Mathematics
2005-06-02T14:15:25Z
2005-06-02T14:15:25Z
1993
1993
http://hdl.handle.net/1721.1/17332
29943299
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1993.
Includes bibliographical references (p. 122-130).
by David Gillman.
Ph.D.
130 p.
5926188 bytes
5925996 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Mathematics
Hidden Markov chains : convergence rates and the complexity of inference
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="3dd22638-ff6f-4c44-ae4c-aeb3037e1893">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Hidden Markov chains : convergence rates and the complexity of inference</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1993</PublicationDate>
<Authors>
<Author>
<DisplayName>Gillman, David Wallace</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mathematics</Keyword>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>