Results 201 to 210 of about 18,079 (224)
Some of the next articles are maybe not open access.
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 +2 more sources
On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems
J. Autom. Lang. Comb., 2002Journal of Automata, Languages and Combinatorics, Volume 7, Number 4, 2002, 433 ...
K. Arthi +2 more
openaire +2 more sources
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems
International Journal of Foundations of Computer Science, 2015We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize programmed grammars with the finite index restriction; looking at the number of components of such ...
Henning Fernau +2 more
openaire +1 more source
Grammar systems: A grammatical approach to distribution and cooperation
1995From the Publisher: This book investigates two major systems: firstly, cooperating distributed grammar systems, where the grammars work on one common sequential form and the cooperation is realized by the control of the sequence of active grammars; secondly, parallel communicating grammar systems, where each grammar works on its own sequential form ...
openaire +1 more source
Accepting cooperating distributed grammar systems with terminal derivation
Bull. EATCS, 2020Summary: 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
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
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
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 ...
openaire +1 more source
Cooperating distributed grammar systems as models of distributed problem solving, revisited
Fundam. Informaticae, 2007Summary: 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
Cooperating/distributed grammar systems: A link between formal languages and artificial intelligence
Bull. EATCS, 2020Summary: 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
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
2008It 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