We consider algorithms for approximating context-free grammars by regular grammars, making use of Chomsky's characterization of non-self-embedding grammars as generating regular languages and a transformation by Mohri and Nederhof on sets of mutually recursive nonterminals. We give an exposition of strongly regular grammars and this transformation, and use it as a subprocedure to obtain tighter regular approximations to a given context-free grammar. In another direction, the generalization by a 1-lookahead extends Mohri and Nederhof's transformation by incorporating more context into the regular approximation at the expense of a larger grammar. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Eǧecioǧlu, Ö. (2009). Strongly regular grammars and regular approximation of context-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5583 LNCS, pp. 207–220). https://doi.org/10.1007/978-3-642-02737-6_16
Mendeley helps you to discover research relevant for your work.