| J00-1003 | states and transitions , for the | superset approximation | based on LR automata following |
| J00-1003 | self-embedding . Similarly , some of the | superset approximations | are not applicable to large grammars |
| W05-1504 | context-free language . Subset and | superset approximations | of ( weighted ) CFLs by ( weighted |
| J00-1003 | strings that are introduced in a | superset approximation | or that are excluded in a subset |
| J00-1003 | self - embedding . A different | superset approximation | based on LR automata was proposed |
| J00-1003 | is the language obtained by a | superset approximation | , and how much smaller is the |
| J00-1003 | accurately . 4.2 Refinement of RTN | Superset Approximation | We rephrase the method of Grimley-Evans |
| J00-1003 | other methods discussed here . 4.6 | Superset Approximation | by N-grams An approximation from |
| J00-1003 | as if they were terminals . 4.1 | Superset Approximation | Based on RTNs The following approximation |
| J06-3005 | Liviu Ciortuz ) 11 A context-free | superset approximation | of unification-based grammars |
| J00-1003 | , 2 , 3 , ... gives rise to a | superset approximation | that can be described as follows |
| J00-1003 | given in Nederhof ( 1998 ) . 4.4 | Superset Approximation | through Pushdown Automata The |
