In classic formal language and automata theory, grammars and automata were modeling
classic computing devices. Such devices were “centralized”—the computation was …

In spite of the wide availability of more powerful (context free, mildly context sensitive, and
even Turing-equivalent) formalisms, the bulk of the applied work on language and …

We investigate the expressive power of timing restrictions on labeled transition systems. In
particular, we show how constraints on clock variables together with a uniform liveness …

We consider grammar systems in which several components are active at the same moment
(a team of components is working). The power of such mechanisms is investigated and it is …

The title above is exactly the title of a monograph [9] published in 1994 by Gordon and
Breach, London. The main aim of the present paper is to present recent notions and results …

Eco-grammar systems (EG systems) have been introduced in [2] for modelling syntactic
properties of ecosystems. In this paper simple EG systems are discussed, which have n …

Abstract Swarm Intelligent Systems are computational models of the spatial evolution of
populations explaining it as a global behavior emerging from locally controlled movements …

Informally, we will consider an agent as a sensor/effector system that operates within an
environment and changes states of that environment by acts performed in it. In present days …

The aim of this paper is at least 2 fold: to give prospective PhD students in the area hints at
where to start a promising research; and to supplement earlier reference lists on parallel …

The main goal of this note is to consider colonies with certain elementary and well motivated
restrictions on the frequency of acting of the components. The additional properties form …