Show simple item record

dc.contributor.authorDill, Jens M.en_US
dc.date.accessioned2007-04-23T17:18:28Z
dc.date.available2007-04-23T17:18:28Z
dc.date.issued1987-03en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-815en_US
dc.identifier.urihttps://hdl.handle.net/1813/6655
dc.description.abstractJazayeri proposes a simpler construction for use in the proof by Jazayeri, Ogden, and Rounds that the circularity problem for attribute grammars has inherent exponential complexity. The simplification introduces a flaw that invalidates the proof. Correcting the flaw leaves the new construction only slightly simpler than the old.en_US
dc.format.extent409333 bytes
dc.format.extent131464 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.titleA Counter-example for "A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars"en_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics