On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
نویسندگان
چکیده
Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six contextfree components. We also present a non-returning universal PC grammar system generating unary languages, that is, a system where not only the number of components, but also the number of productions and the number of nonterminals are limited by certain constants, and these size parameters do not depend on the generated language.
منابع مشابه
Pattern Languages Versus Parallel Communicating Grammar Systems
We compare the power of two (fairly di erent) recently investigated language identifying devices: patterns and parallel communicating (PC) grammar systems. The simulation of multi-patterns by context-free PC grammar systems is rather obvious, but, unexpectedly, this can be realized also by (non-centralized) PC grammar systems with right-linear components. Moreover, in nite multi-patterns formin...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملOn the Degree Complexity of Special Non-Context-Free Languages with Respect to PC Grammar Systems
When modeling natural languages, three languages are of special interest. In natural languages, there occur phenomena like multiple agreements, crossed agreements and replication. These aspects are represented by the three languages K1 = {abc |n ≥ 1}, K2 = {abcd |m,n ≥ 1} and K3 = {ww |w ∈ {a, b}}, respectively. In the present paper, we give parallel communicating grammar systems (PC grammar sy...
متن کاملOn context-free parallel communicating grammar systems: synchronization, communication, and normal forms
In this paper we study the generative power of context-free returning parallel communicating grammar systems using diierent synchronization mechanisms and communication protocols. We demonstrate the equivalence of several types of these systems and present normal form theorems showing that all languages generated by context-free returning parallel communicating grammar systems can also be gener...
متن کاملRemarks on Context-Free Parallel Communicating Grammar Systems Generating Crossed Agreements
When modeling natural languages, three phenomena should be considered: the so-called multiple agreements, crossed agreements and replication. These aspects are represented by the three languages K1 = { a nbncn | n ≥ 1 }, K2 = { a nbmcndm | m ≥ 1, n ≥ 1 }, and K3 = {ww |w ∈ { a, b } + }, respectively. In the present paper, we give parallel communicating grammar systems (PC grammar systems) that ...
متن کامل