Abstract
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.
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.
| Original language | English |
|---|---|
| Journal | Information and Control |
| Volume | 26 |
| Issue | 3 |
| Pages (from-to) | 280-285 |
| Number of pages | 6 |
| ISSN | 0019-9958 |
| DOIs | |
| Publication status | Published - 1974 |