Abstract
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 ``linear composition of behaviours'' with ``closure under basic operations'', such as the AFL (Abstract Families of Languages) operations, which are standard in the theory of formal languages.
Keywords
Cite this article
@article{cai-1334,
author = {Rudolf Freund and Jozef Kelemen and Gheorghe Pãun},
title = {A Note on Emergence in Multi-Agent String Processing Systems},
journal = {Computing and Informatics},
volume = {22},
number = {6},
pages = {623--637},
year = {2003},
issn = {1335-9150},
url = {https://cai.type.sk/content/2003/6/a-note-on-emergence-in-multi-agent-string-processing-systems/}
}
TY - JOUR AU - Rudolf Freund AU - Jozef Kelemen AU - Gheorghe Pãun TI - A Note on Emergence in Multi-Agent String Processing Systems JO - Computing and Informatics VL - 22 IS - 6 SP - 623 EP - 637 PY - 2003 SN - 1335-9150 UR - https://cai.type.sk/content/2003/6/a-note-on-emergence-in-multi-agent-string-processing-systems/ KW - Grammar systems KW - multi-agent systems KW - emergence KW - abstract families of languages ER -
Freund, R., Kelemen, J., & Pãun, G. (2003). A Note on Emergence in Multi-Agent String Processing Systems. Computing and Informatics, 22(6), 623–637. https://cai.type.sk/content/2003/6/a-note-on-emergence-in-multi-agent-string-processing-systems/