In this report we show that, for each alphabet Σ, there exists a context-free grammar G which satisfies the property that for each context-free language L ⊆ Σ* a regular control set C can be found such that LC(G) = L
AbstractThis paper establishes a workspace theorem in terms of regular-controlled (context-free) gra...
A sufficient condition is given in order for the set of those words, which are obtained by permuting...
For a phrase structure grammar G an algebraic approach is used for representing the structural deriv...
In this report we show that, for each alphabet Σ, there exists a context-free grammar G which satisf...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
A context-free grammar G with terminal vocabulary σ is left universal for a class of languages uif11...
A grammar G is left universal (universal) for a family of languages ℒ and finite alphabet Σ with res...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
Control sets on linear grammars are used to define a generalization of the metalinear hierarchy with...
A context-free grammar G with terminal vocabulary σ is left universal for a class of languages uif11...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
AbstractThis paper establishes a workspace theorem in terms of regular-controlled (context-free) gra...
A sufficient condition is given in order for the set of those words, which are obtained by permuting...
For a phrase structure grammar G an algebraic approach is used for representing the structural deriv...
In this report we show that, for each alphabet Σ, there exists a context-free grammar G which satisf...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
A context-free grammar G with terminal vocabulary σ is left universal for a class of languages uif11...
A grammar G is left universal (universal) for a family of languages ℒ and finite alphabet Σ with res...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
Control sets on linear grammars are used to define a generalization of the metalinear hierarchy with...
A context-free grammar G with terminal vocabulary σ is left universal for a class of languages uif11...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
For a context-free grammar form G, the result of the G-control operator acting on a family of langua...
AbstractThis paper establishes a workspace theorem in terms of regular-controlled (context-free) gra...
A sufficient condition is given in order for the set of those words, which are obtained by permuting...
For a phrase structure grammar G an algebraic approach is used for representing the structural deriv...
DOI
Add to ORKG