Open AccessParallel Context-Free Languages
Author(s) -
Sven Skyum
Publication year - 1974
Publication title -
daimi pb
Language(s) - English
Resource type - Journals
eISSN - 2245-9316
pISSN - 0105-8517
DOI - 10.7146/dpb.v3i30.6449
Subject(s) - context (archaeology) , abstract family of languages , relation (database) , language family , computer science , context free language , control (management) , mathematics , programming language , linguistics , second generation programming language , natural language processing , artificial intelligence , rule based machine translation , biology , philosophy , fifth generation programming language , database , programming paradigm , paleontology
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.