Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In [2] it is shown that the family of languages generated by cooperating distributed (CD) grammar systems with context-free components in the derivation modes =k,>.k, for k>2, and the family of EOL languages are incomparable. Because one of the languages used in the proof of the incomparability does not work, we fill here the gap, using another language. We also give an effective procedure for constructing an ETOL system form a given context-free cooperating/distributed (CD) grammar system working in the maximum mode of cooperation.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
103--107
Opis fizyczny
bibliogr. 4 poz.
Twórcy
autor
- Department of Mathematics and Computer Science, Faculty of Science, El Menoufia University, Shebin Elkom, Egypt, Science@shebin.eun.eg
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS1-0003-0073