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

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

2009-07-29

arxiv.org/abs/0907.5119v1

EPTCS 3, 2009, pp. 91-100

Computer Science

Formal Languages and Automata Theory

Scientific paper

10.4204/EPTCS.3.8

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.

Affiliated with

Also associated with

No associations

Rating

On the Size Complexity of Non-Returning Context-Free PC Grammar Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Size Complexity of Non-Returning Context-Free PC Grammar Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Size Complexity of Non-Returning Context-Free PC Grammar Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521633