Results 211 to 220 of about 345 (229)

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   +1 more source

ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS

International Journal of Foundations of Computer Science, 2009
This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the ...
openaire   +2 more sources

Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems

2008
It is well known that certain language families generated by cooperating distributed (CD) grammar systems can be characterized in terms of context-free random context grammars. In particular, the language families generated by CD grammar systems working in the t- and -modes of derivation obey a characterization in terms of ET0L systems, or equivalently
Henning Bordihn, Markus Holzer 0001
openaire   +1 more source

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

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   +1 more source

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ú, Alexandru Mateescu   +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   +1 more source

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

COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH NON-TERMINATING COMPONENTS

Developments In Language Theory, 2000
Henning Bordihn, Markus Holzer 0001
openaire   +1 more source

Controlled Cooperating Distributed Grammar Systems

2018
Erzsébet Csuhaj-Varjú, Jürgen Dassow, Jozef Kelemen, Gheorghe Páun   +3 more
openaire   +1 more source