Book Chapter10.1007/3-540-08921-7_84
Cooperating grammar systems
Robert Meersman,Grzegorz Rozenberg +1 more
- 04 Sep 1978
- pp 364-373
79
TL;DR: A new language generating mechanism is defined that 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.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Gheorghe Paun
- 10 Jul 1995
TL;DR: This book investigates two major systems, cooperating distributed grammar systems and parallel communicating grammar systems, which 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.
443
•Journal Article
On the Power of Membrane Computing
Jürgen Dassow,Gheorghe Paun +1 more
TL;DR: This work compares transition super-cell systems with classic mechanisms in formal language theory, context-free and matrix grammars, E0L and ET0L systems, interpreted as generating mechanisms of number relations (the authors take the Parikh image of the usual language generated by these mechanisms rather than the language).
99
Bounded Parallelism in Array Grammars Used for Character Recognition
Henning Fernau,Rudolf Freund +1 more
- 20 Aug 1996
TL;DR: The aim of this paper is to elaborate the power of cooperation in generating and analysing (handwritten) characters by array grammars by presenting various non-context-free sets of arrays generated by cooperating distributed array grammar systems with prescribed teams working in different modes.
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
TL;DR: It is shown that such externally hybrid CD grammar systems with components working in the t-mode and the ?k-mode, can be characterized by CD Grammar systems with all componentsworking in the (t ∧ ?k)-mode, and these can be characterize by recurrent programmed grammars with appearance checking, or, as well, by ET0L systems with permitting random context.
34
Dynamically controlled cooperating/distributed grammar systems
TL;DR: If the start condition is of random context type, the effect of different conditions for starting and stopping of the components of the grammar system is studied, and at most all matrix languages and the family of context-sensitive languages are obtained.
30
References
•Book
Developmental systems and languages
Aristid Lindenmayer,Grzegorz Rozenberg +1 more
- 01 Jan 1975
TL;DR: Developmental systems were introduced in order to model morphogenetic (pattern-generating) processes in growing, multicellular, filamentous organisms by considering the states and outputs to be identical and thus omitting the output functions.
477
TOL Schemes and Control Sets
TL;DR: When a regular start set L and a regular control set C are given, the set C (L) is an ETOL language, and it is shown that the set ∋(∑) of all possible homomorphisms from a given alphabet ∑ into itself cannot be a control set.
58
Some notes on ETOL-languages
TL;DR: If the order in which the tables of an ETOL-system must be applied is specified, or if a forbidding context is added to the tables, then the resulting class of languages generated, coincides with a subclass of the class of context-free programmed languages.
20
Iterating iterated substitution
TL;DR: By iterating iterated substitution not all regular languages can be copied, so the smallest full hyper (1)-AFL is properly contained in ETOL, the largest full hyper-AFL.
8
Related Papers (5)
Jrgen Dassow,Gheorghe Paun +1 more
- 01 Jan 1989
[...]
Jürgen Dassow,Gheorghe Păun,Grzegorz Rozenberg +2 more
- 01 Apr 1997
[...]
Arto Salomaa
- 01 Aug 1973