An extension for the concept of the finite index of context-free grammars is introduced and regular control languages are derived for the resulting family of languages generated by ordered context-free grammars
A new operation on languages, called the “cap operation” is introduced, and corresponding “cap expre...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
In this report we show that, for each alphabet Σ, there exists a context-free grammar G which satisf...
For context-free grammars the restrictive devices of unordered scattered context, random context, pa...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
It is proved that the languages generated by context-free grammars, whose rules are partially ordere...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
It is shown that there is a context-free language which has one grammar of finite index and another ...
Control sets on linear grammars are used to define a generalization of the metalinear hierarchy with...
For context-free grammars, all of the following restrictive devices are equivalent with respect to g...
It is proved that every grammar for a bounded, context-free language has finite index
A new operation on languages, called the “cap operation” is introduced, and corresponding “cap expre...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
A hierarchy of context-free grammars and languages with respect to the index of context-free grammar...
In this report we show that, for each alphabet Σ, there exists a context-free grammar G which satisf...
For context-free grammars the restrictive devices of unordered scattered context, random context, pa...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
It is proved that the languages generated by context-free grammars, whose rules are partially ordere...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
It is shown that there is a context-free language which has one grammar of finite index and another ...
Control sets on linear grammars are used to define a generalization of the metalinear hierarchy with...
For context-free grammars, all of the following restrictive devices are equivalent with respect to g...
It is proved that every grammar for a bounded, context-free language has finite index
A new operation on languages, called the “cap operation” is introduced, and corresponding “cap expre...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
DOI
Add to ORKG