On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
Erzsébet Csuhaj-Varjú, György Vaszil
Electronic Proceedings in Theoretical Computer Science · 2009
doi:10.4204/eptcs.3.8 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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 context-free 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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.