Regular approximation of context-free grammars through transformation
From MaRDI portal
Recommendations
- Strongly Regular Grammars and Regular Approximation of Context-Free Languages
- Regular approximation of CFLs: A grammatical view
- Regular Approximation of Weighted Linear Context-Free Tree Languages
- On the existence of regular approximations
- A new algorithm for regularizing one-letter context-free grammars.
Cited in
(13)- A new algorithm for regularizing one-letter context-free grammars.
- Analyzing ambiguity of context-free grammars
- Verification of opacity and diagnosability for pushdown systems
- On the existence of regular approximations
- An experimental ambiguity detection tool
- Regular approximation of CFLs: A grammatical view
- Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
- Analyzing Ambiguity of Context-Free Grammars
- Strongly Regular Grammars and Regular Approximation of Context-Free Languages
- Simple linear string constraints
- XML graphs in program analysis
- APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES
- Grammatical Inference: Algorithms and Applications
This page was built for publication: Regular approximation of context-free grammars through transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776249)
