Results 191 to 200 of about 345 (229)

Chromatin-dependent motif syntax defines differentiation trajectories.

Mol Cell
Durdu S, Iskar M, Isbel L, Hoerner L, Wirbelauer C, Burger L, Hess D, Iesmantavicius V, Schübeler D.   +8 more
europepmc   +1 more source

Review of "J. Dassow, G. Paun & S. Vicolov, On the power of cooperating/distributed grammar systems with regular components, Found. Comput. Decision Sci. 18 (1993) 83-108"

Mathematical reviews, 1995
openaire   +1 more source

Review of "E. Csuhaj-Varju & J. Dassow, On cooperating/distributed grammar systems, J. Inform. Process. Cybernet. 26 (1990) 49-63"

Mathematical reviews, 1991
openaire   +1 more source

Deterministic cooperating distributed grammar systems [PDF]

Lecture Notes in Computer Science, 1997
Subclasses 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.
Valeria Mihalache, Victor Mitrana
exaly   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Cooperating/distributed grammar systems with hypothesis languages

Journal of Experimental & Theoretical Artificial Intelligence, 1991
Abstract 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
openaire   +3 more sources

Dynamically controlled cooperating/distributed grammar systems

Information Sciences, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erzsébet Csuhaj-Varjú, Jürgen Dassow, Gheorghe Paun   +2 more
openaire   +3 more sources

On a hierarchy of languages generated by cooperating distributed grammar systems

Information Processing Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn, Markus Holzer 0001
openaire   +4 more sources

Generalised Stream X-Machines and Cooperating Distributed Grammar Systems

Formal Aspects of Computing, 2000
Abstract. 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, Gheorghe Marian
openaire   +4 more sources

On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems

Lecture Notes in Computer Science, 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   +3 more sources

On cooperating/distributed grammar systems with different styles of acceptance

International Journal of Computer Mathematics, 1992
Cooperating/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 ...
Erzsébet Csuhaj-Varjú, Jürgen Dassow, Jozef Kelemen   +2 more
openaire   +3 more sources