The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction

Authors:
Joost Engelfriet
Affiliations:
Dept. of Computer Science, Leiden University, P .O .Box 9512, 2300 RA Leiden, The Netherland
Venue:
ACM SIGACT News
Year:
1989

Citing 7
Cited 0

The complexity of languages generated by attribute grammars

SIAM Journal on Computing
A counter-example for “a simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars”

Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
Alternation

Journal of the ACM (JACM)
A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars

Journal of the ACM (JACM)
The intrinsically exponential complexity of the circularity problem for attribute grammars

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown in [Dil] that the construction in [Jaz] is incorrect. A correct version of the construction can be found in [EngFil].