Results 191 to 200 of about 10,447,458 (221)

Dynamically controlled cooperating/distributed grammar systems

Information Sciences, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Dassow
exaly   +2 more sources

On a hierarchy of languages generated by cooperating distributed grammar systems

Information Processing Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn, Markus Holzer 0001
exaly   +4 more sources

Generalised Stream X-Machines and Cooperating Distributed Grammar Systems

Formal Aspects of Computing, 2000
Abstract. Stream X-machines are a general and powerful computational model. By coupling the control structure of a stream X-machine with a set of formal grammars a new machine called a generalised stream X-machine with underlying distributed grammars , acting as a translator, is obtained.
Marian Gheorghe
exaly   +4 more sources

On cooperating/distributed grammar systems with different styles of acceptance

International Journal of Computer Mathematics, 1992
Cooperating/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 ...
Jürgen Dassow, Józef Kelemen
exaly   +2 more sources

On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems

Lecture Notes in Computer Science, 2004
Probabilistic 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 ...
Jürgen Dassow
exaly   +3 more sources

A note on cooperating distributed grammar systems working in combined modes

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn, Markus Holzer
exaly   +4 more sources

A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems

Lecture Notes in Computer Science, 2012
We 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
exaly   +3 more sources

Remarks on the Relationship Between Cooperating Distributed Grammar Systems and Lindenmayer Systems

Fundamenta Informaticae, 1998
In [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 ...
exaly   +3 more sources

A novel cryptosystem based on cooperating distributed grammar systems

International Journal of Artificial Intelligence and Soft Computing, 2017
D. Jayaseelan Samuel, P. J. Abisha
exaly   +4 more sources

On the Expressive Power of Valences in Cooperating Distributed Grammar Systems

Lecture Notes in Computer Science, 2011
Henning Fernau
exaly   +2 more sources