Cooperating distributed grammar systems with permitting grammars as components

E. Csuhaj-Varjú, Toma S. Masopust, Gyaorgy Vaszil

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

This paper studies cooperating distributed grammar systems working in the terminal derivation mode where the components are variants of permitting grammars. It proves that although the family of permitting lan- guages is strictly included in the family of random context languages, the families of random context languages and languages generated by permitting cooperating distributed grammar systems in the above mentioned derivation mode coincide. Moreover, if the components are so-called left-permitting grammars, then co- operating distributed grammar systems in the terminal mode characterize the class of context-sensitive languages, or if erasing rules are allowed, the class of recursively enumerable languages. Descriptional complexity results are also pre- sented. It is shown that the number of permitting components can be bounded, in the case of left-permitting components with erasing rules even together with the number of nonterminals.

Original languageEnglish
Pages (from-to)175-189
Number of pages15
JournalRomanian Journal of Information Science and Technology
Volume12
Issue number2
Publication statusPublished - 2009

Fingerprint

Context sensitive languages

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Cooperating distributed grammar systems with permitting grammars as components. / Csuhaj-Varjú, E.; Masopust, Toma S.; Vaszil, Gyaorgy.

In: Romanian Journal of Information Science and Technology, Vol. 12, No. 2, 2009, p. 175-189.

Research output: Contribution to journalArticle

@article{9fafdfd505f9428ebcba480307513b15,
title = "Cooperating distributed grammar systems with permitting grammars as components",
abstract = "This paper studies cooperating distributed grammar systems working in the terminal derivation mode where the components are variants of permitting grammars. It proves that although the family of permitting lan- guages is strictly included in the family of random context languages, the families of random context languages and languages generated by permitting cooperating distributed grammar systems in the above mentioned derivation mode coincide. Moreover, if the components are so-called left-permitting grammars, then co- operating distributed grammar systems in the terminal mode characterize the class of context-sensitive languages, or if erasing rules are allowed, the class of recursively enumerable languages. Descriptional complexity results are also pre- sented. It is shown that the number of permitting components can be bounded, in the case of left-permitting components with erasing rules even together with the number of nonterminals.",
author = "E. Csuhaj-Varj{\'u} and Masopust, {Toma S.} and Gyaorgy Vaszil",
year = "2009",
language = "English",
volume = "12",
pages = "175--189",
journal = "Romanian Journal of Information Science and Technology",
issn = "1453-8245",
publisher = "Publishing House of the Romanian Academy",
number = "2",

}

TY - JOUR

T1 - Cooperating distributed grammar systems with permitting grammars as components

AU - Csuhaj-Varjú, E.

AU - Masopust, Toma S.

AU - Vaszil, Gyaorgy

PY - 2009

Y1 - 2009

N2 - This paper studies cooperating distributed grammar systems working in the terminal derivation mode where the components are variants of permitting grammars. It proves that although the family of permitting lan- guages is strictly included in the family of random context languages, the families of random context languages and languages generated by permitting cooperating distributed grammar systems in the above mentioned derivation mode coincide. Moreover, if the components are so-called left-permitting grammars, then co- operating distributed grammar systems in the terminal mode characterize the class of context-sensitive languages, or if erasing rules are allowed, the class of recursively enumerable languages. Descriptional complexity results are also pre- sented. It is shown that the number of permitting components can be bounded, in the case of left-permitting components with erasing rules even together with the number of nonterminals.

AB - This paper studies cooperating distributed grammar systems working in the terminal derivation mode where the components are variants of permitting grammars. It proves that although the family of permitting lan- guages is strictly included in the family of random context languages, the families of random context languages and languages generated by permitting cooperating distributed grammar systems in the above mentioned derivation mode coincide. Moreover, if the components are so-called left-permitting grammars, then co- operating distributed grammar systems in the terminal mode characterize the class of context-sensitive languages, or if erasing rules are allowed, the class of recursively enumerable languages. Descriptional complexity results are also pre- sented. It is shown that the number of permitting components can be bounded, in the case of left-permitting components with erasing rules even together with the number of nonterminals.

UR - http://www.scopus.com/inward/record.url?scp=77956094769&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956094769&partnerID=8YFLogxK

M3 - Article

VL - 12

SP - 175

EP - 189

JO - Romanian Journal of Information Science and Technology

JF - Romanian Journal of Information Science and Technology

SN - 1453-8245

IS - 2

ER -