On the Succintness of Different Representations of Languages
| dc.contributor.author | Hartmanis, Juris | en_US |
| dc.date.accessioned | 2007-04-23T18:21:48Z | |
| dc.date.available | 2007-04-23T18:21:48Z | |
| dc.date.issued | 1978-06 | en_US |
| dc.description.abstract | The purpose of this paper is to give simple new proofs of some interesting recent results about the relative succintness of different representations of regular, deterministic and unambiguous context-free languages and to derive some new results about how the relative succintness of representations change when the representations contain a formal proof that the languages generated are in the desired subclass of languages. | en_US |
| dc.format.extent | 642375 bytes | |
| dc.format.extent | 219525 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-346 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7464 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the Succintness of Different Representations of Languages | en_US |
| dc.type | technical report | en_US |