On the Size Complexity of Non-Returning Context-Free PC Grammar Systems

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 context-free components. We also present a non-returning universal PC grammar system generating unary languages, tha...

Full description

Bibliographic Details
Main Authors: Erzsébet Csuhaj-Varjú, György Vaszil
Format: Article
Language:English
Published: Open Publishing Association 2009-07-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/0907.5119v1
id doaj-d2a9ff4a002841608e1bf4b3a9965357
record_format Article
spelling doaj-d2a9ff4a002841608e1bf4b3a99653572020-11-24T23:04:55ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802009-07-013Proc. DCFS 20099110010.4204/EPTCS.3.8On the Size Complexity of Non-Returning Context-Free PC Grammar SystemsErzsébet Csuhaj-VarjúGyörgy VaszilImproving 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. http://arxiv.org/pdf/0907.5119v1
collection DOAJ
language English
format Article
sources DOAJ
author Erzsébet Csuhaj-Varjú
György Vaszil
spellingShingle Erzsébet Csuhaj-Varjú
György Vaszil
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
Electronic Proceedings in Theoretical Computer Science
author_facet Erzsébet Csuhaj-Varjú
György Vaszil
author_sort Erzsébet Csuhaj-Varjú
title On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
title_short On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
title_full On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
title_fullStr On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
title_full_unstemmed On the Size Complexity of Non-Returning Context-Free PC Grammar Systems
title_sort on the size complexity of non-returning context-free pc grammar systems
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2009-07-01
description 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.
url http://arxiv.org/pdf/0907.5119v1
work_keys_str_mv AT erzsebetcsuhajvarju onthesizecomplexityofnonreturningcontextfreepcgrammarsystems
AT gyorgyvaszil onthesizecomplexityofnonreturningcontextfreepcgrammarsystems
_version_ 1725628552560246784

Similar Items