From the Publisher:
This book investigates two major systems: firstly, cooperating distributed grammar systems, where the grammars work on one common sequential form and the cooperation is realized by the control of the sequence of active grammars; secondly, parallel communicating grammar systems, where each grammar works on its own sequential form and cooperation is done by means of communicating between grammars. The investigation concerns hierarchies with respect to different variants of cooperation, relations with classical formal language theory, syntactic parameters such as the number of components and their size, power of synchronization, and general notions generated from artificial intelligence.

Grammar Systems: A Grammatical Approach to Distribution and Cooperation

We continue the investigation of the power of the computability models introduced in [Gh. Paun, Computing with membranes, TUCS Report 208, November 1998] under the name of transition super-cell systems. We compare these systems with classic mechanisms in formal language theory, context-free and matrix grammars, E0L and ET0L systems, interpreted as generating mechanisms of number relations (we take the Parikh image of the usual language generated by these mechanisms rather than the language). Several open problems are also formulated.

On the Power of Membrane Computing

A new language generating mechanism is defined. It is derived from a generalization of the two-level substitution mechanism and involves several (incomplete) grammars which communicate with each other by introducing variables for which they have no productions themselves. When the grammars are context-free, this yields an alternative definition for the context-free programmed grammars. When the grammars are EOL (parallel) a class is found lying (strictly ?) between ETOL and CFP.

Cooperating grammar systems

The aim of this paper is to elaborate the power of cooperation in generating and analysing (handwritten) characters by array grammars. We present various non-context-free sets of arrays that can be generated in a simple way by cooperating distributed array grammar systems with prescribed teams working in different modes and show the power of the mechanism of cooperation for picture description and analysis as well as the efficiency of these models where several sets of productions work in parallel on the given sentential form.

/pdf/bounded-parallelism-in-array-grammars-used-for-character-1ftl4ay4t5.pdf

Bounded Parallelism in Array Grammars Used for Character Recognition

Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization

Persistent ET0L systems

A language-generating mechanism, inspired on the two-level van Wijngaarden syntax for Algol 68, is considered. Its language generating properties are studied and compared to those of well-known classical systems and grammars. The new mechanism is called a 2 MSG, for "two-level metacontrolled substitution grammar."

Two-level meta-controlled substitution grammars

A new language-generating mechanism, inspired on the two-level Van Wijngaarden syntax for Algol 68, is defined Its language generating properties are studied and compared to those of well-known classical systems and grammars The new mechanism is called a 2MSG, for "two-level meta-controlled substitution grammar"

Robert Meersman

Papers

Cooperating grammar systems

Persistent ET0L systems

Two-level meta-controlled substitution grammars

Two-level meta-controlled substitution grammars

Parallelism and synchronization in two-level metacontrolled substitution grammars