Results 191 to 200 of about 18,079 (224)
Some of the next articles are maybe not open access.
Cooperating/distributed grammar systems with hypothesis languages
Journal of Experimental and Theoretical Artificial Intelligence, 1991Abstract Motivated by the blackboard model of artificial intelligence we introduce the concept of context-free cooperating/distributed grammar systems with hypothesis languages. We prove that these grammar systems have the same generative power as context-sensitive grammars.
Jürgen Dassow
exaly +2 more sources
Deterministic cooperating distributed grammar systems
Lecture Notes in Computer Science, 1997Subclasses of grammar systems that can facilitate parser construction appear to be of interest. In this paper, some syntactical conditions considered for strict deterministic grammars are extended to cooperating distributed grammar systems, restricted to the terminal derivation mode.
Víctor Mitrana
exaly +2 more sources
Generalised Stream X-Machines and Cooperating Distributed Grammar Systems
Formal Aspects of Computing, 2000Abstract. 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 +3 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 ...
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, 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 ...
Jürgen Dassow
exaly +2 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
exaly +3 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
exaly +2 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 ...
exaly +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
exaly +2 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