<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Erzsebet Csuhaj-Varjú</style></author><author><style face="normal" font="default" size="100%">Gheorghe Paun</style></author><author><style face="normal" font="default" size="100%">György Vaszil</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">PC grammar systems with five context-free components generate all recursively enumerable languages</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">descriptional complexity</style></keyword><keyword><style  face="normal" font="default" size="100%">parallel communicating grammar systems</style></keyword><keyword><style  face="normal" font="default" size="100%">recursively enumerable languages</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam (The Netherlands)</style></pub-location><volume><style face="normal" font="default" size="100%">299</style></volume><pages><style face="normal" font="default" size="100%">785 - 794   </style></pages><abstract><style face="normal" font="default" size="100%">Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language. 


</style></abstract><issue><style face="normal" font="default" size="100%">1-3  </style></issue></record></records></xml>