JavaScript is disabled for your browser. Some features of this site may not work without it.
Use of eCommons for rapid dissemination of COVID-19 research
In order to maximize the discoverability of COVID-19 research, and to conform with repository best practices and the requirements of publishers and research funders, we provide special guidance for COVID-19 submissions.
A Counter-example for "A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars"
Abstract
Jazayeri 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.
Date Issued
1987-03Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-815
Type
technical report