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.
M. Holzer
semanticscholar +4 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
semanticscholar +4 more sources
Controlled Cooperating Distributed Grammar Systems
Grammar Systems:, 2018Erzsébet Csuhaj-Varjú +3 more
semanticscholar +4 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 +3 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 +3 more sources
On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar Systems
J. Autom. Lang. Comb., 2006Journal of Automata, Languages and Combinatorics, Volume 11, Number 4, 2006, 435 ...
Bettina Sunckel
openaire +2 more sources
On cooperating/distributed grammar systems with different styles of acceptance
International Journal of Computer Mathematics, 1992Cooperating/distributed grammar systems are a formal model of blackboard architectures for problem solving. We introduce different notions of acceptance of a sentential form as a solution. We compare them with respect to the generative power and present statements on the hierarchy according to the number of grammars in the systems with different ...
Erzsébet Csuhaj-Varjú +2 more
openaire +3 more sources
On a connection between cooperating distributed grammar systems and basic process algebra
Fundam. Informaticae, 2006Summary: We discuss some relationships between cooperating distributed (CD) grammar systems and the basic process algebra (BPA) calculus. We associate different types of process graphs from this calculus to CD grammar systems which describe the behavior of the components of the system under cooperation.
Erzsébet Csuhaj-Varjú +1 more
openaire +4 more sources
On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems
Lecture Notes in Computer Science, 2004Probabilistic cooperating distributed grammar systems introduced in [1] are systems of probabilistic grammars in the sense of [9], i.e., a probability is associated with any transition from one rule to another rule and with any transition from one probabilistic grammar to another probabilistic grammar; a probabilistic grammar stops, if the chosen rule ...
Erzsébet Csuhaj-Varjú, Jürgen Dassow
openaire +3 more sources
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