The following problem is investigated. Let L be a given finite language, L⊂Ln = ab: 1≤a,b≤n, a≠b. Determine the minimal natural number c(L) such that L can be generated by c(L) context-free productions.Among others, max c(L) = O(n2/log n) is proved, and languages satisfying c(L) = ¦L¦are characterized
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractA tree controlled grammar is specified as a pair (G,G′) where G is a context-free grammar an...
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...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
AbstractW. Bucher, K. Culik II, H. Maurer and D. Wotschke (Theoretical Computer Science 14(1981), pp...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
AbstractThis paper is a contribution to the theory of grammatical complexity, in particular to the f...
Let $L_n$ be the finite language of all $n!$ strings that are permutations of $n$ different symbols ...
Some complexity measures which are well-known for context-free languages are generalized in order to...
AbstractLet Ln be the finite language of all n! strings that are permutations of n different symbols...
AbstractWe consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach ...
It is proved that every grammar for a bounded, context-free language has finite index
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractA tree controlled grammar is specified as a pair (G,G′) where G is a context-free grammar an...
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...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
AbstractW. Bucher, K. Culik II, H. Maurer and D. Wotschke (Theoretical Computer Science 14(1981), pp...
AbstractIn this paper the investigation of the theory of grammatical complexity as started by Bucher...
AbstractIn this note we answer an open question in the theory of grammatical complexity: We show tha...
AbstractThis paper is a contribution to the theory of grammatical complexity, in particular to the f...
Let $L_n$ be the finite language of all $n!$ strings that are permutations of $n$ different symbols ...
Some complexity measures which are well-known for context-free languages are generalized in order to...
AbstractLet Ln be the finite language of all n! strings that are permutations of n different symbols...
AbstractWe consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach ...
It is proved that every grammar for a bounded, context-free language has finite index
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
AbstractA tree controlled grammar is specified as a pair (G,G′) where G is a context-free grammar an...
AbstractLet k, lϵN and L ⊆ {a, b}∗ be a context-free language and Lk, l be the set of words w such t...
DOI
Add to ORKG