Abstract
We show that for each context-free grammar a new grammar can be constructed that generates a regular language. This construction differs from some existing methods of approximation in that use of a pushdown automaton is avoided. This allows better insight into how the generated language is affected.
Cite
CITATION STYLE
APA
Nederhof, M.-J. (2000). Regular Approximation of CFLS: A Grammatical View (pp. 221–241). https://doi.org/10.1007/978-94-015-9470-7_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free