Results 211 to 220 of about 12,323,046 (229)
Some of the next articles are maybe not open access.

On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar Systems

J. Autom. Lang. Comb., 2006
Journal of Automata, Languages and Combinatorics, Volume 11, Number 4, 2006, 435 ...
openaire   +2 more sources

Cooperating distributed grammar systems as models of distributed problem solving, revisited

Fundam. Informaticae, 2007
Summary: 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

A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems

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.
openaire   +2 more sources

Accepting cooperating distributed grammar systems with terminal derivation

Bull. EATCS, 1997
Summary: 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   +2 more sources

On a connection between cooperating distributed grammar systems and basic process algebra

Fundam. Informaticae, 2006
Summary: 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   +2 more sources

Cooperating/distributed grammar systems: A link between formal languages and artificial intelligence

Bull. EATCS, 1991
Summary: 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   +2 more sources

The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited

International Journal of Foundations of Computer Science, 2023
Zsolt Gazdag, Sándor Vágvölgyi
exaly  

COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH NON-TERMINATING COMPONENTS

Developments In Language Theory, 2000
Henning Bordihn, Markus Holzer 0001
openaire   +2 more sources

On cooperating distributed grammar systems with competence based start and stop conditions

Fundam. Informaticae, 2007
Summary: 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.
openaire   +2 more sources

Controlled Cooperating Distributed Grammar Systems

2018
Erzsébet Csuhaj-Varjú   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy