On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
Formal Languages and Automata Theory
2009-07-30 v1 Distributed, Parallel, and Cluster Computing
Multiagent Systems
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.
Keywords
Cite
@article{arxiv.0907.5119,
title = {On the Size Complexity of Non-Returning Context-Free PC Grammar Systems},
author = {Erzsébet Csuhaj-Varjú and György Vaszil},
journal= {arXiv preprint arXiv:0907.5119},
year = {2009}
}