Publication date
December 1986
DOI Publisher
Published by Elsevier B.V. ISSN
0304-3975Abstract
AbstractIt is shown that every unambiguous CFG with p productions has size at least 2p−1
AbstractIt is shown that every unambiguous CFG with p productions has size at least 2p−1
In this paper context-free languages are investigated according to their ordering properties. For th...
International audienceMinimalist grammars (MGs) constitute a mildly context-sensitive formalism when...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractFor all ε > 0 we prove for every sufficiently large n: There exists a context-free language ...
AbstractIt is shown that every unambiguous CFG with p productions has size at least 2p−1
AbstractW. Bucher, K. Culik II, H. Maurer and D. Wotschke (Theoretical Computer Science 14(1981), pp...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
AbstractLet k, lϵN and L ⊆ {a, b}∗ be a context-free language and Lk, l be the set of words w such t...
The following problem is investigated. Let L be a given finite language, L⊂Ln = ab: 1≤a,b≤n, a≠b. De...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
AbstractFor every pair of positive integers n and p, there is a language accepted by a real-time det...
AbstractDeviating from the definition originally presented in [12], Stabler [13] introduced—inspired...
Proceedings of the 16th Nordic Conference of Computational Linguistics NODALIDA-2007. Editors: Jo...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
In this paper context-free languages are investigated according to their ordering properties. For th...
International audienceMinimalist grammars (MGs) constitute a mildly context-sensitive formalism when...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractFor all ε > 0 we prove for every sufficiently large n: There exists a context-free language ...
AbstractIt is shown that every unambiguous CFG with p productions has size at least 2p−1
AbstractW. Bucher, K. Culik II, H. Maurer and D. Wotschke (Theoretical Computer Science 14(1981), pp...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
AbstractLet k, lϵN and L ⊆ {a, b}∗ be a context-free language and Lk, l be the set of words w such t...
The following problem is investigated. Let L be a given finite language, L⊂Ln = ab: 1≤a,b≤n, a≠b. De...
Given a reduced, cycle-free context-free grammar G = (Φ, Σ, P, y1), the following statements are equ...
AbstractFor every pair of positive integers n and p, there is a language accepted by a real-time det...
AbstractDeviating from the definition originally presented in [12], Stabler [13] introduced—inspired...
Proceedings of the 16th Nordic Conference of Computational Linguistics NODALIDA-2007. Editors: Jo...
Paz 1967defines ε-approximation of probabilistic finite acceptors (p.ac.) and proves that the class ...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
In this paper context-free languages are investigated according to their ordering properties. For th...
International audienceMinimalist grammars (MGs) constitute a mildly context-sensitive formalism when...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
Add to ORKG