Observational complexity of character strings.
Citable URI:
http://hdl.handle.net/1721.1/51478
| Title: | Observational complexity of character strings. |
| Author: | Seiferas, Joel I |
| Advisor: | John J. Donovan. |
| Department: | Massachusetts Institute of Technology. Dept. of Electrical Engineering |
| Publisher: | Massachusetts Institute of Technology |
| Issue Date: | 1972 |
| Description: |
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1972. M.S. MICROFICHE COPY ALSO AVAILABLE IN BARKER ENGINEERING LIBRARY. Bibliography: leaf 129. |
| URI: | http://hdl.handle.net/1721.1/51478 |
| Keywords: | Electrical Engineering |
Files in this item
| Files | Size | Format | View | Description |
|---|---|---|---|---|
| Preview, non-printable (open to all) | 4.402Mb |
View/ |
Preview, non-printable (open to all) | |
| Full printable version (MIT only) | 4.780Mb |
View/ |
Full printable version (MIT only) |
This item appears in the following Collection(s)
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|