Results 201 to 210 of about 60,674 (237)
Some of the next articles are maybe not open access.
Further remarks on parallel communicating grammar systems
International Journal of Computer Mathematics, 1990We 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
openaire +3 more sources
Parallel Communicating Grammar Systems with Incomplete Information Communication
Grammars, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erzsébet Csuhaj-Varjú, György Vaszil
openaire +4 more sources
On the generative capacity of parallel communicating grammar systems
International Journal of Computer Mathematics, 1992The 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.
Gheorghe P[acaron]un +2 more
exaly +5 more sources
Parallel Communicating Grammar Systems with Regular Control
Lecture Notes in Computer Science, 2009Parallel 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 +3 more sources
Parallel communicating grammar systems: the context-sensitive case
International Journal of Computer Mathematics, 1993We prove that any recursively enumerable set can be generated by a returning synchronized parallel communicating grammar system of degree three, where one of its components is context-sensitive and the other two are regular (without using λ-rules). In the case that the rule S → λ is used in at least one component (S being the axiom), the returning or ...
O. Procopiuc +2 more
openaire +3 more sources
Parallel Communication Synchronized Pure Pattern Grammar Systems with Filters
2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011Motivated by the study of pure pattern grammars by Abisha et al (2000), and parallel communicating grammar systems with communication by commands of Csuhaj -- Varju et al (2006), a new generative device, herein after referred as parallel communicating synchronizing pure pattern grammar systems with filters is introduced.
Sindhu J. Kumaar, P. J. Abisha
openaire +3 more sources
ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS
International Journal of Foundations of Computer Science, 2007A generalization of centralized and returning parallel communicating grammar systems with linear components (linear CPC grammar systems) is studied. It is known that linear CPC grammar systems are more powerful than regular CPC grammar systems and that CPC grammar systems with context-free components are more powerful than linear CPC grammar systems ...
Andreas Malcher, Bettina Sunckel
openaire +1 more source
Parallel communicating grammar systems with negotiation
Fundamenta Informaticae, 1996In 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
Parallel Communicating Grammar Systems As Language Analyzers
Grammars, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Bordihn +2 more
openaire +2 more sources