Results 191 to 200 of about 770 (231)

Parallel Communicating Grammar Systems with Regular Control [PDF]

open access: yesLecture Notes in Computer Science, 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
Martin Platek   +2 more
exaly   +3 more sources

Parallel Communicating Grammar Systems with Incomplete Information Communication [PDF]

open access: yesLecture Notes in Computer Science, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
György Vaszil   +2 more
exaly   +4 more sources

Probabilistic Parallel Communicating Grammar Systems

International Journal of Computer Mathematics, 2002
Grammar systems are theoretical models of distributed computing which play a major role in modern Computer Science. In this paper, we define and study a variant of Parallel Communicating(PC) grammar systems namely, Probabilistic PC grammar systems which serves as a grammatical model for random distributed processing.
K Arthi, Kamala Krithivasan
exaly   +2 more sources

Further remarks on parallel communicating grammar systems

International Journal of Computer Mathematics, 1990
We continue the study of parallel communicating grammar systems introduced in P[acaron]un and Sântean [7] as a grammatical model of parallel computing. The investigated topics are: closure properties, the efficiency of generating a (linear) language by such a system compared with usual grammars, hierarchies.
Gheorghe Paun, Lila Santean
exaly   +2 more sources

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.
Pǎun Gheorghe
exaly   +3 more sources

On the generative capacity of parallel communicating grammar systems

International Journal of Computer Mathematics, 1992
The paper deals with synchronized and non-synchronized parallel communicating grammar systems (PCGS). Our results show, for instance, the high generative power of these mechanisms: one-letter non-regular and other non-semi-linear languages are generated by certain classes of PCGS's, mainly with regular components.
Arto Salomaa
exaly   +4 more sources

Learning Subclasses of Parallel Communicating Grammar Systems [PDF]

open access: yes, 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   +2 more sources

Home - About - Disclaimer - Privacy