Pages that link to "Item:Q2776249"
From MaRDI portal
The following pages link to Regular approximation of context-free grammars through transformation (Q2776249):
Displaying 12 items.
- Simple linear string constraints (Q469349) (← links)
- XML graphs in program analysis (Q532414) (← links)
- A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
- Analyzing ambiguity of context-free grammars (Q2266946) (← links)
- Verification of opacity and diagnosability for pushdown systems (Q2375627) (← links)
- On the existence of regular approximations (Q2465045) (← links)
- An experimental ambiguity detection tool (Q2653935) (← links)
- Regular approximation of CFLs: A grammatical view (Q2776326) (← links)
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199) (← links)
- Analyzing Ambiguity of Context-Free Grammars (Q3503908) (← links)
- APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES (Q5462124) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493021) (← links)