Parallel Context-Free Languages

Authors

  • Sven Skyum

DOI:

https://doi.org/10.7146/dpb.v3i30.6449

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.

Information and Control, 26 (1974) pp. 280-285.

Author Biography

Sven Skyum

Downloads

Published

1974-06-01

How to Cite

Skyum, S. (1974). Parallel Context-Free Languages. DAIMI Report Series, 3(30). https://doi.org/10.7146/dpb.v3i30.6449