Show simple item record

dc.contributor.authorSchmidt, Erik Meinecheen_US
dc.date.accessioned2007-04-23T18:11:56Z
dc.date.available2007-04-23T18:11:56Z
dc.date.issued1976-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-277en_US
dc.identifier.urihttps://hdl.handle.net/1813/7319
dc.description.abstractThere is no recursive function bounding the succintness gained using ambiguous grammars over unambiguous ones in the description of unambiguous context-free languages.en_US
dc.format.extent765713 bytes
dc.format.extent279301 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleSuccinctness of Descriptions of Unambiguous Context-Free Languagesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics