Parallel context-free languages

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Department of Computer Science
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.
Original languageEnglish
JournalInformation and Control
Volume26
Issue3
Pages (from-to)280-285
Number of pages6
ISSN0019-9958
DOIs
Publication statusPublished - 1974

See relations at Aarhus University Citationformats

ID: 37175966