DOIAbstract
It is proved that the languages generated by context-free grammars, whose rules are partially ordered, constitute an intermediate class between the context-free and context-sensitive languages; the first inclusion is shown to be proper
It is proved that the languages generated by context-free grammars, whose rules are partially ordered, constitute an intermediate class between the context-free and context-sensitive languages; the first inclusion is shown to be proper
In this paper context-free languages are investigated according to their ordering properties. For th...
An abstract family of grammars (AFG) may be defined as a class of grammars for which the correspondi...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
It is proved that the languages generated by context-free grammars, whose rules are partially ordere...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
AbstractBy a reduction to Post's Correspondence Problem we provide a direct proof of the known fact ...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
The concept of SVMT-bounded grammars is introduced. It is shown that SVMT-bounded grammars generate ...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
A new class of grammars (precedence-regular grammars) is obtained as a proper extension of the class...
AbstractMultiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars i...
In this paper context-free languages are investigated according to their ordering properties. For th...
An abstract family of grammars (AFG) may be defined as a class of grammars for which the correspondi...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
It is proved that the languages generated by context-free grammars, whose rules are partially ordere...
An extension for the concept of the finite index of context-free grammars is introduced and regular ...
AbstractBy a reduction to Post's Correspondence Problem we provide a direct proof of the known fact ...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
By a reduction to Post's Correspondence Problem we provide a direct proof of the known fact that the...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
The concept of SVMT-bounded grammars is introduced. It is shown that SVMT-bounded grammars generate ...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
AbstractWe define context-free grammars with Müller acceptance condition that generate languages of ...
A new class of grammars (precedence-regular grammars) is obtained as a proper extension of the class...
AbstractMultiple context-free grammars (mcfg's) is a subclass of generalized context-free grammars i...
In this paper context-free languages are investigated according to their ordering properties. For th...
An abstract family of grammars (AFG) may be defined as a class of grammars for which the correspondi...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
Add to ORKG