The family of languages generated by matrix grammars with context-free (context-free λ-free) core productions and with a leftmost restriction on derivations equals the family of recursively enumerable (context-sensitive) languages
AbstractA left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set ...
Infinite subfamilies ℒ1, ℒ2..., ℒ∞, ℒω of the family consisting of contextsensitive languages, are i...
AbstractWe show that, in the case of context-free programmed grammars with appearance checking worki...
The family of languages generated by matrix grammars with context-free (context-free λ-free) core pr...
It is shown that every type 1 language can be generated by an ε-free simple matrix grammar (of order...
The matrix grammar is a well-known concept of a grammar with restricted use of productions. By weake...
For context-free grammars the restrictive devices of unordered scattered context, random context, pa...
For context-free grammars, all of the following restrictive devices are equivalent with respect to g...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
It is shown that every type 1 language can be generated by an ε-free simple matrix grammar (of order...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
The context-free matrix grammar and the state grammar without any restriction in applying production...
A grammar G is left universal (universal) for a family of languages ℒ and finite alphabet Σ with res...
The notion of a grammar form is extended to context-free matrix grammars yielding so-called matrix f...
Some complexity measures which are well-known for context-free languages are generalized in order to...
AbstractA left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set ...
Infinite subfamilies ℒ1, ℒ2..., ℒ∞, ℒω of the family consisting of contextsensitive languages, are i...
AbstractWe show that, in the case of context-free programmed grammars with appearance checking worki...
The family of languages generated by matrix grammars with context-free (context-free λ-free) core pr...
It is shown that every type 1 language can be generated by an ε-free simple matrix grammar (of order...
The matrix grammar is a well-known concept of a grammar with restricted use of productions. By weake...
For context-free grammars the restrictive devices of unordered scattered context, random context, pa...
For context-free grammars, all of the following restrictive devices are equivalent with respect to g...
In this note we present an elementary proof of the following result due to T. Kasai: for each alphab...
It is shown that every type 1 language can be generated by an ε-free simple matrix grammar (of order...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
The context-free matrix grammar and the state grammar without any restriction in applying production...
A grammar G is left universal (universal) for a family of languages ℒ and finite alphabet Σ with res...
The notion of a grammar form is extended to context-free matrix grammars yielding so-called matrix f...
Some complexity measures which are well-known for context-free languages are generalized in order to...
AbstractA left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set ...
Infinite subfamilies ℒ1, ℒ2..., ℒ∞, ℒω of the family consisting of contextsensitive languages, are i...
AbstractWe show that, in the case of context-free programmed grammars with appearance checking worki...
DOI
Add to ORKG