Pages that link to "Item:Q2266946"
From MaRDI portal
The following pages link to Analyzing ambiguity of context-free grammars (Q2266946):
Displaying 9 items.
- A note on the expressive power of probabilistic context free grammars (Q851193) (← links)
- A note on ambiguity in context-free grammars (Q911784) (← links)
- Equivalent conversions of ambiguous context-free grammars (Q1183782) (← links)
- Ambiguity management in grammar writing (Q1768825) (← links)
- Algebraic dynamic programming on trees (Q2633220) (← links)
- An experimental ambiguity detection tool (Q2653935) (← links)
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199) (← links)
- Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata (Q2817371) (← links)
- An ambiguity hierarchy of weighted context-free grammars (Q6049933) (← links)