Pages that link to "Item:Q4080746"

The following pages link to The intrinsically exponential complexity of the circularity problem for attribute grammars (Q4080746):

Displaying 19 items.

• Simple multi-visit attribute grammars (Q584934) (← links)
• A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
• Computational and attribute models of formal languages (Q912638) (← links)
• The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
• A formal methodology using attributed grammars for multiprocessing-system software development. II. Validation (Q1061483) (← links)
• Composition and evaluation of attribute coupled grammars (Q1099964) (← links)
• Complexity characterizations of attribute grammar languages (Q1120290) (← links)
• A near-optimal method for reasoning about action (Q1134756) (← links)
• The formal power of one-visit attribute grammars (Q1157968) (← links)
• Testing attribute grammars for circularity (Q1162165) (← links)
• Attribute grammars and recursive program schemes. I. II (Q1162363) (← links)
• The method of attributes for data flow analysis. I: Exhaustive analysis (Q1249039) (← links)
• Ordered attributed grammars (Q1256863) (← links)
• Attribute and unification grammar: A review and analysis of formalisms (Q1353898) (← links)
• Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
• A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
• k-visit attribute grammars (Q3928271) (← links)
• An order-algebraic definition of knuthian semantics (Q4181304) (← links)
• Acyclic Contextual Hyperedge Replacement: Decidability of Acyclicity and Generative Power (Q6487303) (← links)