| dc.contributor.author | Masek, William Joseph. | en_US |
| dc.date.accessioned | 2008-10-02T19:15:14Z | |
| dc.date.available | 2008-10-02T19:15:14Z | |
| dc.date.copyright | 1976 | en_US |
| dc.date.issued | 1976 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/26753 | en_US |
| dc.description | Thesis: M.S., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 1976 | en_US |
| dc.description | Includes bibliographies. | en_US |
| dc.description.statementofresponsibility | by William J. Masek. | en_US |
| dc.format.extent | 58 leaves | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.rights | MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | en_US |
| dc.subject | Electrical Engineering and Computer Science | en_US |
| dc.subject.lcsh | Algorithms. | en_US |
| dc.subject.lcsh | Computer programming. | en_US |
| dc.subject.lcsh | Turing machines. | en_US |
| dc.subject.other | Turing machines. fast | en_US |
| dc.subject.other | Computer programming. fast | en_US |
| dc.subject.other | Algorithms. fast | en_US |
| dc.title | A fast algorithm for the string editing problem and decision graph complexity | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | M.S. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.identifier.oclc | 02864911 | en_US |
| dc.description.collection | M.S. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science | en_US |
| dspace.imported | 2026-01-06T22:00:53Z | en_US |
