Results 191 to 200 of about 12,323,046 (229)

Left-Forbidding Cooperating Distributed Grammar Systems

open access: yesTheoretical Computer Science, 2010
A left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set of nonterminal symbols is attached to each context-free production.
Tomáš Masopust, Alexander Meduna
exaly   +4 more sources
Some of the next articles are maybe not open access.

Dynamically Controlled Cooperating/Distributed Grammar Systems

Information Sciences, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erzsébet Csuhaj-Varju   +2 more
exaly   +2 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.
M Holzer
exaly   +4 more sources

Cooperating/Distributed Grammar Systems With Hypothesis Languages

Journal of Experimental and 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
exaly   +3 more sources

A Novel Cryptosystem Based on Cooperating Distributed Grammar Systems

International Journal of Artificial Intelligence and Soft Computing, 2017
D. Jayaseelan Samuel, P. J. Abisha
exaly   +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
exaly   +4 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-Varju   +2 more
exaly   +2 more sources

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 ...
Tomáš Masopust
exaly   +4 more sources

Hybrid Modes in Cooperating Distributed Grammar Systems: Internal Versus External Hybridization

open access: yesTheoretical Computer Science, 2001
We introduce several internally hybrid derivation modes of Cooperating Distributed (CD) grammar systems. External hybridizations were investigated by Mitrana and Păun: for example, some components of a CD grammar system, when enabled, have to work as long as possible -- they work in the so-called \(t\)-mode --, and some others, when enabled, perform at
M Holzer, R Freund
exaly   +3 more sources

Deterministic cooperating distributed grammar systems

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

Home - About - Disclaimer - Privacy