See Nederhof ( 1998 ) for a variant of this approximation that constructs finite transducers rather than finite automata .
contextfree parsing through regular approximation
Mark-Jan Nederhof
However , our implementation applies the construction separately for each nonterminal in a set N , such that recursive ( N ) = self , which leads to a separate subautomaton of the compact representation ( Section 3 ) . See Nederhof ( 1998 ) for a variant of this approximation that constructs finite transducers rather than finite automata . We have further implemented a parameterized version of the RTN approximation .
See @@CITATION for a variant of this approximation that constructs finite transducers rather than finite automata .