1 The representation in Mohri and Pereira ( 1998 ) is even more compact than ours for grammars that are not self-embedding .
dynamic compilation of weighted contextfree grammars
Mehryar Mohri Fernando C N Pereira
This means that new e-transitions connect q to the start state of A , and the final states of A , to q ' . 1 The representation in Mohri and Pereira ( 1998 ) is even more compact than ours for grammars that are not self-embedding . However , in this paper we use our representation as an intermediate result in approximating an unrestricted context-free grammar , with the final objective of obtaining a single minimal deterministic automaton .
1 The representation in @@CITATION is even more compact than ours for grammars that are not self-embedding .