A note on cooperating distributed grammar systems working in combined modes
Information Processing Letters, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn, Markus Holzer 0001
openaire +4 more sources
Remarks on the Relationship Between Cooperating Distributed Grammar Systems and Lindenmayer Systems
Fundamenta Informaticae, 1998In [2] it is shown that the family of languages generated by cooperating distributed (CD) grammar systems with context-free components in the derivation modes = k, ≥ k, for k ≥ 2, and the family of E0L languages are incomparable. Because one of the languages used in the proof of the incomparability does not work, we fill here the gap, using another ...
Mohamed Amin
openaire +4 more sources
A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems
Lecture Notes in Computer Science, 2012We investigate the generative power of cooperating distributed grammar systems (CDGS) with context-free rules working in cut-f-mode of derivation, when f is a full-competence mode in combination with another derivation mode, combined sf-mode, for short.
Markus Holzer, Holzer Markus
openaire +3 more sources
A novel cryptosystem based on cooperating distributed grammar systems
International Journal of Artificial Intelligence and Soft Computing, 2017D. Jayaseelan Samuel, P. J. Abisha
openaire +3 more sources
Stochastic cooperative distributed grammar systems and random graphs
Acta Informatica, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ján Gaso, Martin Nehéz
openaire +2 more sources
Cooperating Distributed Grammar Systems – the Basic Model [PDF]
, 2018 Erzsébet Csuhaj-Varjú +3 more
openaire +2 more sources
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components
J. Autom. Lang. Comb., 2002Different modes have been considered in cooperating distributed grammar systems. Here, we consider graph-controlled grammars whose rules are applied according to one specified mode and investigate their generating power. Alternatively, these grammars may be seen as graph-controlled cooperating distributed grammar systems whose components have only ...
Henning Fernau, Markus Holzer 0001
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
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 +1 more source