The relation between the family of context-free languages and the family of parallel context-free languages is examined in this paper.It is proved that the families are incomparable.Finally we prove that the family of languages of finite index is contained in the family of parallel context-free languages
An example is given of a context-free grammar with infinite index. This solves a problem proposed by...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractA relation between ET0L systems and parallel multiple context-free grammars (PMCFGs) is cons...
The relation between the family of context-free languages and the family of parallel context-free l...
The relation between the family of context-free languages and the family of parallel context-free la...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
AbstractWe investigate the context-free languages whose complements are also context-free. We call t...
It is proved that every grammar for a bounded, context-free language has finite index
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. ...
AbstractThe theorem stating that the family of frontiers of recognizable tree languages is exactly t...
We prove here that the context-free languages family (CFL) and the matrix languages of finite index ...
Watson-Crick automata were introduced as a new computer model and have been intensively investigated...
This bibliography on parallel parsing and recognition of context-free languages covers most of the i...
This bibliography on parallel parsing and recognition of context-free languages covers most of the i...
We prove the following results concerning the index of grammars and languages. (1) Any context-free ...
An example is given of a context-free grammar with infinite index. This solves a problem proposed by...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractA relation between ET0L systems and parallel multiple context-free grammars (PMCFGs) is cons...
The relation between the family of context-free languages and the family of parallel context-free l...
The relation between the family of context-free languages and the family of parallel context-free la...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
AbstractWe investigate the context-free languages whose complements are also context-free. We call t...
It is proved that every grammar for a bounded, context-free language has finite index
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. ...
AbstractThe theorem stating that the family of frontiers of recognizable tree languages is exactly t...
We prove here that the context-free languages family (CFL) and the matrix languages of finite index ...
Watson-Crick automata were introduced as a new computer model and have been intensively investigated...
This bibliography on parallel parsing and recognition of context-free languages covers most of the i...
This bibliography on parallel parsing and recognition of context-free languages covers most of the i...
We prove the following results concerning the index of grammars and languages. (1) Any context-free ...
An example is given of a context-free grammar with infinite index. This solves a problem proposed by...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractA relation between ET0L systems and parallel multiple context-free grammars (PMCFGs) is cons...
DOI
Add to ORKG