Jozef Kelemen

A grammar-theoretic treatment of multiagent systems

A variant of cooperating and distributed grammar systems—the so-called colony—is studied to capture some aspects of multiagent systems consisting of a finite number of very simple autonomous agents. A colony is considered as a set up from a finite number of regular grammars generating finite languages that cooperate without any explicit predefined strategy. Generative power and hierarchical properties of colonies are investigated. The behavioral (generative) stability of colonies as well as a modified model augmenting agents by ‘clocks’ is studied. It is proved that the generative power of colonies with augmented components overcomes the generative power of colonies without clocks.

Syntactical models of distributed cooperative systems

Abstract The central aim of this paper is to inform on a specific direction of language-theoretic research focused on modelling distributed and cooperative systems. The basic view of distributivity and cooperativeness is adopted from classical approaches of artificial intelligence, especially from the field of problem-solving and blackboard architectures. Basic concepts are translated into the conceptual framework of the theory of formal grammars and languages. An overview is presented of some approaches to distributivity and cooperativeness in this framework, and some of the results that have been obtained are sketched.

On parallelism in colonies

Colonies (basically, grammar systems with the components generating finite languages) with parallel activity (all the components that can work must work) in two variants are defined here and their generative capacity is investigated. It is found that the (strong) parallelism increases the power of colonies, but subfamilies of matrix languages are obtained.

Computation, Cooperation, and Life

Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd computation cooperation and life essays dedicated to gheorghe paun on the occasion of his 60th birthday lecture notes in computer science that can be a new way to explore the knowledge. When reading this book, you can get one thing to always remember in every reading time, even step by step.

Trends, Techniques, and Problems in Theoretical Computer Science

Lower bound techniques for VLSI algorithms.- The equivalence of mappings on languages.- Kleenes theorem revisited.- Some combinatorial problems concerning finite languages.- A connection between descriptional complexity of context-free grammars and grammar form theory.- Basic ideas of selective substitution grammars.- Some recent restrictions in the derivation of context-free grammars.- Recent results on the theory of homogeneous structures.- A note on the ratio function in DOL systems.- Models for multicellular development: Characterization, inference and complexity of L-systems.- A formal model of knowledge-based systems.- Basic complexity analysis of hypothesis formation.- Perspectives of logic programming.

A note on achieving low-level rationality from pure reactivity

The paper connects a decision-theoretic model of rationality and a generative (grammar-theoretic) model of multiagent systems called colonies. The decision-theoretic notion of the low-level rationality of agents is introduced. Then, a characterization of a subclass of low-level rational agents is given in the formal framework of colonies. In other words, it is proved that at least the low-level rationality of some agents can emerge from activities of their autonomous purely reactive and individually non-rational components.

Artificial living beings and robots: one root, variety of influences

The concept of the robot originated, during the 20th century, and then influenced many areas of human activities in the fields of science, engineering, and economy, but also the arts and culture in general, to a considerable extent. This contribution sketches very briefly the original meaning of the notion of a robot, and then some of the transformations of the original meaning, and some of the influences of the concept of robot during the past century. The currently unreflected fact — the roots of the idea of artificial life as well as the idea of robots in Karel Čapek’s famous play R. U. R. — is also mentioned.

From Statistics to Emergence: Exercises in Systems Modularity

The contribution sketches several ways of considering systems from the position of their modularity through viewing systems without any attention focused to their modularization, then as composed from functionally specified modules, up to the post-modular systems consisting of relatively independent autonomous modules sharing a common environment and acting in it. A relatively simple, uniform and productive theoretical framework for study of the mentioned aspects of systems behavior and modularity - the framework of the theory of grammar systems - will be presented, illustrated and discussed in certain details.

On extended Similarity Scoring and Bit-vector Algorithms for design smell detection

The occurrence of design smells or anti-patterns in software models complicate development process and reduce the software quality. The contribution proposes an extension to Similarity Scoring Algorithm and Bit-vector Algorithm, originally used for design patterns detection. This paper summarizes both original approaches, important differences between design patterns and anti-patterns structures, modifications and extensions of algorithms and their application to detect selected design smells.

May embodiment cause hyper-computation?

The contribution provides an example of how a formal model of some life-like functions – the so called eco-grammar (EG) system – provides a framework in which it is formally provable that the computational power of the model – under some very natural circumstances derived from the specificities of living systems, esp. from their embodiment – may overcome the computational limits of traditional computing models, perhaps also the computational power of the universal Turing machine.