Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components

We show how to generate any recursively enumerable language with a nonreturning PC grammar system having eight context-free components. This is an improvement of descriptional complexity compared to the previously known construction where the number of component grammars depends on the generated language and can be arbitrarily high.