<?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%">Carlos Martín-Vide</style></author><author><style face="normal" font="default" size="100%">Victor Mitrana</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Fernando Sancho-Caparrini</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Hybrid Networks of Evolutionary Processors</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/3yt2w7kgp6h5ctkm/?p=2bf594953627437eb4eed4e04713f308&pi=48</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</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%">2723</style></volume><pages><style face="normal" font="default" size="100%">401-412</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-40602-0</style></isbn><abstract><style face="normal" font="default" size="100%">A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the words existing in that node in accordance with some strategies. Then the words which can pass the output filter of each node navigate simultaneously through the network and enter those nodes whose input filter was passed. We prove that these networks with filters defined by simple random-context conditions, used as language generating devices, are able to generate all linear languages in a very efficient way, as well as non-context-free languages. Then, when using them as computing devices, we present two linear solutions of the Common Algorithmic Problem.
</style></abstract></record></records></xml>