Results 211 to 220 of about 12,114,445 (243)
Some of the next articles are maybe not open access.

Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space

Parallel Processing Letters, 2016
Coverability trees offer a finite characterization of all the derivations of a context-free parallel grammar system (CF-PCGS). Their finite nature implies that they necessarily omit some information about these derivations. We demonstrate that the omitted information is most if not all of the time too much, and so coverability trees are not useful as ...
Stefan D. Bruda, Mary Sarah Ruth Wilkin
openaire   +4 more sources

Parallel communicating grammar systems with negotiation

Fundamenta Informaticae, 1996
In a parallel communicating grammar system, several grammars work together, synchronously, on their own sentential forms, and communicate on request. No restriction is imposed usually about the communicated strings. We consider here two types of restrictions, as models of the negotiation process in multi-agent systems: (1) conditions formulated on the ...
Gheorghe Paun   +2 more
openaire   +2 more sources

Translations by Regulated Parallel Communicating Grammar Systems

J. Autom. Lang. Comb., 2011
Parallel communicating grammar systems (PCGSs) and their regulated variant (RPCGSs) generate languages. We introduce a translation as a binary relation between the words generated simultaneously by two components of such a system. Using sample translations corresponding to the distributive law from algebra we show that RPCGSS can generate a hierarchy ...
Dana Pardubská   +2 more
openaire   +1 more source

On the synchronization in parallel communicating grammar systems

Acta Informatica, 1993
The power of various types of synchronization in parallel communication grammar systems is investigated. These systems were introduced by the author and \textit{L. Santean} [Ann. Univ. Bucuresti, Series Matem.-Inform., 38, No. 2, 55-63 (1989; Zbl 0749.68048)] and consist of more Chomsky grammars working together for generating one language.
openaire   +3 more sources

Parallel Communicating Grammar Systems with Regular Control

2009
Parallel communicating grammar systems with regular control (RPCGS, for short) are introduced, which are obtained from returning regular parallel communicating grammar systems by restricting the derivations that are executed in parallel by the various components through a regular control language. For the class of languages that are generated by RPCGSs
Dana Pardubská   +2 more
openaire   +2 more sources

Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems

J. Autom. Lang. Comb., 1997
This paper deals with regular Parallel Communicating Grammar Systems (PCGS, for short) as introduced in [12], and basically it has two main parts. The first one introduces and studies processes and partial words of PCGS, while the second one gives some vectorial characterizations of sequential languages of PCGS.
Ferucio Laurentiu Tiplea   +2 more
openaire   +3 more sources

Learning Subclasses of Parallel Communicating Grammar Systems

2010
Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest. In this paper an algorithm to learn a parallel communicating grammar system in which the master component is a regular grammar and the other components are pure pattern grammars is given.
Sindhu J. Kumaar   +2 more
openaire   +1 more source

Bounded communication in parallel communicating grammar systems

J. Inf. Process. Cybern., 1994
Summary: We consider parallel grammar systems with a bounded number of communications in any derivation (bounded PCGS) and we study their computational power. Thus, a pumping lemma for such systems is established and infinite hierarchies are obtained. Finally, the languages generated by \(k\)-bounded centralized PCGS of degree 2 are shown to be \((k+ 1)
Cecilia Magdalena Ionescu   +1 more
openaire   +2 more sources

Parallel communicating grammar systems with communication by signals

1997
We consider PC grammar systems with communication by request, but with the communicated strings defined dynamically, according to certain regular languages associated to system components (like in CCPC grammar systems). The power of such systems is investigated.
openaire   +1 more source

Home - About - Disclaimer - Privacy