Dynamically formed Clusters of Agents in Eco-Grammar Systems

In this paper we extend the conditions of dynamic team constitution in simple eco–grammar systems, motivated by the bottom–up–clustering algorithm. The relationships of simple eco–grammar systems formed according to the newly introduced conditions to each other as well as to certain language classes of the Chomsky hierarchy and L systems are established. We prove that any recursively enumerable language can be obtained as the intersection of a regular language and the language of simple eco–grammar systems where the active teams are organized according to different conditions of team constitution. We also propose some further research directions.

[1]  Erzsébet Csuhaj-Varjú,et al.  Team Behaviour in Eco-Grammar Systems , 1998, Theor. Comput. Sci..

[2]  Stefan Wermter,et al.  Predictive Top-Down Knowledge Improves Neural Exploratory Bottom-Up Clustering , 2004, ECIR.

[3]  Zsolt Palotai,et al.  Bottom-up clustering and top-down shattering of scale-free environments for information fusion , 2004 .

[4]  Gheorghe Paun,et al.  Prescribed teams of grammars , 2005, Acta Informatica.

[5]  Maurice H. ter Beek,et al.  Simple Eco-Grammar Systems with Prescribed Teams , 1999, Grammatical Models of Multi-Agent Systems.

[6]  Dietmar Wätjen.  Remarks on Simple Eco-Grammar Systems with Prescribed Teams , 2003, J. Autom. Lang. Comb..

[7]  Erzsébet Csuhaj-Varjú,et al.  Eco-Grammar Systems: A Grammatical Framework for Studying Lifelike Interactions , 1997, Artificial Life.

[8]  Gheorghe Paun,et al.  On the Generative Capacity of Hybrid CD Grammar Systems , 1994, J. Inf. Process. Cybern..

[9]  G. Paun,et al.  On parallelism in colonies , 1993 .

[10]  Maurice H. ter Beek,et al.  Teams in Grammar Systems: Hybridity and Weak Rewriting , 1996, Acta Cybern..

[11]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[12]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[13]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[14]  Rudolf Freund,et al.  Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization , 2001, Theor. Comput. Sci..

[15]  Dietmar Wätjen.  Function-dependent teams in eco-grammar systems , 2003, Theor. Comput. Sci..

[16]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[17]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

[18]  Victor Mitrana,et al.  Hybrid cooperating/distributed grammar systems , 1993 .

[19]  Jason Cong,et al.  Edge separability based circuit clustering with application to circuit partitioning , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[20]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[21]  Markus Holzer,et al.  Grammar Systems with Negated Conditions in their Cooperation Protocols , 2000, J. Univers. Comput. Sci..

[22]  Jason Cong,et al.  A Parallel Bottom-up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design , 1993, 30th ACM/IEEE Design Automation Conference.

[23]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Rudolf Freund,et al.  Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k , 2003, Theor. Comput. Sci..

[25]  Victor Mitrana,et al.  Dynamical Teams in Eco-Grammar Systems , 2000, Fundam. Informaticae.

[26]  V. Latora,et al.  Harmony in the Small-World , 2000, cond-mat/0008357.

[27]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .