<?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%">Jozef Kelemene</style></author><author><style face="normal" font="default" size="100%">Rudolf Freund</style></author><author><style face="normal" font="default" size="100%">Gheorghe Paun</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Note on Emergence in Multi-Agent String Processing Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Computing and Informatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">abstract families of languages</style></keyword><keyword><style  face="normal" font="default" size="100%">emergence</style></keyword><keyword><style  face="normal" font="default" size="100%">Grammar systems</style></keyword><keyword><style  face="normal" font="default" size="100%">multi-agent systems</style></keyword></keywords><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.cai.sk/</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Eslovaquia</style></pub-location><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">623-637</style></pages><abstract><style face="normal" font="default" size="100%">We propose a way to define (and, in a certain extent, even to measure) the phenomenon of emergence which appears in a complex system of interacting agents whose global behaviour can be described by a language and whose components (agents) can also be associated with grammars and languages. The basic idea is to identify the &quot;linear composition of behaviours&quot; with &quot;closure under basic operations&quot;, such as the AFL (Abstract Families of Languages) operations, which are standard in the theory of formal languages. 

</style></abstract><issue><style face="normal" font="default" size="100%">6</style></issue></record></records></xml>