The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems
International Journal of Foundations of Computer Science, 2015We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize programmed grammars with the finite index restriction; looking at the number of components of such ...
Henning Fernau +2 more
openaire +2 more sources
This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the ...
Tomas Masopust
openaire +3 more sources
On cooperating distributed grammar systems with competence based start and stop conditions
Fundam. Informaticae, 2007Summary: We define cooperating distributed grammar systems with start and stop conditions which are based on the competence of a component on the current sentential form. We distinguish six different types of competence conditions which result in 18 types of grammar systems.
J. Dassow
openaire +4 more sources
Cooperating Distributed Grammar Systems – the Basic Model
Grammar Systems:, 2018Erzsébet Csuhaj-Varjú +3 more
openaire +2 more sources
On the Expressive Power of Valences in Cooperating Distributed Grammar Systems
Computation, Cooperation, and Life, 2011Henning Fernau, Ralf Stiebe
openaire +2 more sources
On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems
J. Autom. Lang. Comb., 2002Journal of Automata, Languages and Combinatorics, Volume 7, Number 4, 2002, 433 ...
K. Arthi +2 more
openaire +2 more sources
Grammar systems: A grammatical approach to distribution and cooperation
1995From 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 ...
openaire +1 more source
Accepting cooperating distributed grammar systems with terminal derivation
Bull. EATCS, 2020Summary: We study the dual of a cooperating distributed grammar system, working in the dual of the terminal derivation mode. We find that the acceptance power of it is exactly the same as the generative power of the original system, deriving in the terminal mode. That way, the results outlined in \textit{H. Fernau}, \textit{M.
openaire +1 more source
Cooperating distributed grammar systems as models of distributed problem solving, revisited
Fundam. Informaticae, 2007Summary: Based on a derivation mode \(f\) for cooperating distributed (CD) grammar systems, we introduce a new form of cooperation protocol, the so-called ``cut-\(f\)-mode'' of derivation. Intuitively, in the cut-\(f\)-mode of derivation the sentential form is partitioned (cut) into several subwords, where some of these subwords are distributed to the ...
Henning Bordihn, Markus Holzer 0001
openaire +2 more sources
Cooperating/distributed grammar systems: A link between formal languages and artificial intelligence
Bull. EATCS, 2020Summary: In the EATCS Bulletin 42 a summarizing report was given by \textit{L. Santean} [Bull. EAMCS 42, 160-171 (1990)] on parallel communicating grammar systems which form one grammatical model of the operations of distributed resources. Our paper can be considered as a continuation of Santean's paper.
Jürgen Dassow, Jozef Kelemen
openaire +1 more source

