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

Stochastic cooperative distributed grammar systems and random graphs

Acta Informatica, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ján Gaso, Martin Nehéz
openaire   +3 more sources

Hybrid Modes in Cooperating Distributed Grammar Systems: Combining the t-Mode With the Modes ⩽k and =k

open access: yesTheoretical Computer Science, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M Holzer, R Freund
exaly   +4 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

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components

J. Autom. Lang. Comb., 2002
Different 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   +4 more sources

The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems

International Journal of Foundations of Computer Science, 2015
We 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
exaly   +3 more sources

On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems

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 ...
Erzsébet Csuhaj-Varjú, Jürgen Dassow
openaire   +2 more sources

On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems

J. Autom. Lang. Comb., 2002
Journal of Automata, Languages and Combinatorics, Volume 7, Number 4, 2002, 433 ...
K. Arthi   +2 more
openaire   +3 more sources

Grammar systems: A grammatical approach to distribution and cooperation

1995
From 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   +2 more sources

Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems

Lecture Notes in Computer Science, 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
exaly   +2 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 ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy