On the public citation graph

The Complexity of Languages Generated by Attribute Grammars

https://doi.org/10.1137/0215005
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-08342-1_18openalex-snapshot
On the time and tape complexity of hyper(1)-AFL's
inferredcites →https://doi.org/10.1007/3-540-08342-1_40openalex-snapshot
The time and tape complexity of developmental languages
inferredcites →https://doi.org/10.1007/3-540-10250-7_25openalex-snapshot
On defining semantics by means of extended attribute grammars
inferredcites →https://doi.org/10.1007/bf00264472openalex-snapshot
Interpretation and reduction of attribute grammars
inferredcites →https://doi.org/10.1007/bf00276181openalex-snapshot
The parsing problem for affix grammars
inferredcites →https://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bf01695769openalex-snapshot
Mappings and grammars on trees
inferredcites →https://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
inferredcites →https://doi.org/10.1007/bf01786975openalex-snapshot
Three hierarchies of transducers
inferredcites →https://doi.org/10.1016/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
inferredcites →https://doi.org/10.1016/0022-0000(80)90058-6openalex-snapshot
Tree transducers, L systems, and two-way machines
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot
Attribute grammars and recursive program schemes I
inferredcites →https://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferredcites →https://doi.org/10.1016/s0019-9958(77)90058-4openalex-snapshot
Recognition of deterministic ETOL languages in logarithmic space
inferredcites →https://doi.org/10.1016/s0019-9958(77)90309-6openalex-snapshot
IO-macrolanguages and attributed translations
inferredcites →https://doi.org/10.1016/s0019-9958(81)90466-6openalex-snapshot
Passes and paths of attribute grammars
inferredcites →https://doi.org/10.1080/00207167708803138openalex-snapshot
The complexity of the membership problem for some extensions of context-free languagest†
inferredcites →https://doi.org/10.1080/00207168108803261openalex-snapshot
Time and space complexity of inside-out macro languages
inferredcites →https://doi.org/10.1137/0207030openalex-snapshot
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
inferredcites →https://doi.org/10.1137/0213010openalex-snapshot
Alternating Pushdown and Stack Automata
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/322077.322083openalex-snapshot
On the Tape Complexity of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.1145/322276.322283openalex-snapshot
A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars
inferredcites →https://doi.org/10.1145/361227.361231openalex-snapshot
The intrinsically exponential complexity of the circularity problem for attribute grammars
inferredcites →https://doi.org/10.7146/dpb.v3i33.6453openalex-snapshot
The Mathematical Theory of L Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-36206-1_24openalex-snapshot
The Complexity of Compositions of Deterministic Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_18openalex-snapshot
String Languages Generated by Total Deterministic Macro Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_3openalex-snapshot
Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-642-95486-3_20openalex-snapshot
L Systems and Nlog — Reductions
inferred← citeshttps://doi.org/10.1007/bf01178504openalex-snapshot
Context-free hypergraph grammars have the same term-generating power as attribute grammars
inferred← citeshttps://doi.org/10.1007/s00236-019-00360-8openalex-snapshot
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90114-dopenalex-snapshot
On attribute grammars without attribute synthesis
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90084-lopenalex-snapshot
Relating attribute grammars and lexical-functional grammars
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90046-7openalex-snapshot
Pattern selector grammars and several parsing algorithms in the context-free style
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90020-6openalex-snapshot
Properties that characterize LOGCFL
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90025-9openalex-snapshot
Complexity characterizations of attribute grammar languages
inferred← citeshttps://doi.org/10.1016/b978-0-444-81641-2.50026-5openalex-snapshot
Performance Specification and Measurement
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00190-4openalex-snapshot
Independent parallelism in finite copying parallel rewriting systems
inferred← citeshttps://doi.org/10.1145/157485.165085openalex-snapshot
Performance specification using attributed grammars
inferred← citeshttps://doi.org/10.1145/28395.28411openalex-snapshot
Properties that characterize LOGCFL
inferred← citeshttps://doi.org/10.1145/70642.70645openalex-snapshot
The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction
inferred← citeshttps://doi.org/10.3115/977180.977217openalex-snapshot
Computational aspects of M-grammars
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1757openalex-snapshot
The Complexity of Tree Transducer Output Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0683openalex-snapshot
Context-Free Grammars with Storage
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.