JavaScript is disabled for your browser. Some features of this site may not work without it.
Succinctness of Descriptions of Unambiguous Context-Free Languages
| dc.contributor.author | Schmidt, Erik Meineche | en_US |
| dc.date.accessioned | 2007-04-23T18:11:56Z | |
| dc.date.available | 2007-04-23T18:11:56Z | |
| dc.date.issued | 1976-04 | en_US |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR76-277 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7319 | |
| dc.description.abstract | There 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.extent | 765713 bytes | |
| dc.format.extent | 279301 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| 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 | Succinctness of Descriptions of Unambiguous Context-Free Languages | en_US |
| dc.type | technical report | en_US |
