scholarly journals Parallel Communicating String - Graph P System

2011 ◽  
Vol 10 (2) ◽  
pp. 63-74
Author(s):  
Meena Parvathy Sankar ◽  
N.G. David
Keyword(s):  
P Systems ◽  
P System ◽  
Generative Power ◽  
Grammar System ◽  
Graph Language ◽  
String Graph ◽  
Language L ◽  
Grammar Systems ◽  
Parallel Communicating Grammar Systems

The concept of parallel communicating grammar systems generating string languages is extended to string-graph P systems and their generative power is studied. It is also established that for every language L generated by a parallel communicating grammar system there exists an equivalent parallel communicating string-graph P system generating the string-graph language corresponding to L.

scholarly journals Splicing Context-Free Matrix Grammars using Parallel Communicating Grammar Systems

2019 ◽  
Vol 8 (12) ◽  
pp. 1281-1283
Keyword(s):  
Dna Computing ◽  
Computational Theory ◽  
Generative Power ◽  
Grammar System ◽  
Grammar Systems ◽  
Context Free ◽  
Theoretical Results ◽  
Parallel Communicating Grammar Systems

Extensive research on splicing of strings in DNA computing has established important theoretical results in computational theory. Further, splicing on strings has been extended to arrays in[2]. In this context, we propose, a grammar system, using queries to splice context-free matrix grammars and show that the language generated by this grammar system is incomparable to the language given in [3] and has more generative power than in [2].

ON METALINEAR PARALLEL COMMUNICATING GRAMMAR SYSTEMS

2007 ◽  
Vol 18 (06) ◽  
pp. 1313-1322
Author(s):  
ANDREAS MALCHER ◽  
BETTINA SUNCKEL
Keyword(s):  
Intermediate Model ◽  
Grammar System ◽  
Grammar Systems ◽  
Context Free ◽  
Parallel Communicating Grammar Systems

A 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. Here, the intermediate model of metalinear CPC grammar systems is studied. This is a CPC grammar system where the master is allowed to use metalinear rules whereas the remaining components are restricted to use linear rules only. It turns out that metalinear CPC grammar systems are more powerful than linear CPC grammar systems and less powerful than CPC grammar systems with context-free components. Furthermore, it is shown that all languages generated by metalinear CPC grammar systems are semilinear.

CHARACTERIZING REGULAR LANGUAGES BY SPIKING NEURAL P SYSTEMS

2007 ◽  
Vol 18 (06) ◽  
pp. 1247-1256 ◽  
Author(s):  
OSCAR H. IBARRA ◽  
SARA WOODWORTH
Keyword(s):  
Regular Languages ◽  
P Systems ◽  
P System ◽  
Spiking Neural P Systems ◽  
Language L

We look at spiking neural P systems (SN P systems, for short) all of whose neurons are bounded. We show that a language L ⊆ (0 + 1)* is regular if and only if 1L (i. e., with a supplementary prefix of 1) is generated by a bounded SN P system. This result does not hold when the prefix is replaced by a suffix. For example, 0*1 cannot be generated by a bounded SN P system.

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

2016 ◽  
Vol 26 (03) ◽  
pp. 1650012
Author(s):  
Stefan D. Bruda ◽  
Mary Sarah Ruth Wilkin
Keyword(s):  
Linear Space ◽  
Decision Problems ◽  
Analysis Tool ◽  
Context Sensitive ◽  
Grammar System ◽  
Grammar Systems ◽  
Context Free ◽  
Parallel Communicating Grammar Systems

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 an analysis tool except for their limited use already considered in the paper that introduces them (namely, determining the decidability of certain decision problems over PCGS). We establish this result by invalidating an existing proof that synchronized CF-PCGS are less expressive than context-sensitive grammars. Indeed, we discover that this proof relies on coverability trees for CF-PCGS, but that such coverability trees do not in fact contain enough information to support the proof.

scholarly journals Novel Numerical Spiking Neural P Systems with a Variable Consumption Strategy

Processes ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 549
Author(s):  
Xiu Yin ◽  
Xiyu Liu ◽  
Minghe Sun ◽  
Qianqian Ren
Keyword(s):  
Production Functions ◽  
P Systems ◽  
P System ◽  
Computing Device ◽  
Spiking Neural P Systems ◽  
Distributed Parallel Computing ◽  
Production Values ◽  
Novel Variant ◽  
Turing Universality ◽  
Variable Consumption

A novel variant of NSN P systems, called numerical spiking neural P systems with a variable consumption strategy (NSNVC P systems), is proposed. Like the spiking rules consuming spikes in spiking neural P systems, NSNVC P systems introduce a variable consumption strategy by modifying the form of the production functions used in NSN P systems. Similar to the delay feature of the spiking rules, NSNVC P systems introduce a postponement feature into the production functions. The execution of the production functions in NSNVC P systems is controlled by two, i.e., polarization and threshold, conditions. Multiple synaptic channels are used to transmit the charges and the production values in NSNVC P systems. The proposed NSNVC P systems are a type of distributed parallel computing models with a directed graphical structure. The Turing universality of the proposed NSNVC P systems is proved as number generating/accepting devices. Detailed descriptions are provided for NSNVC P systems as number generating/accepting devices. In addition, a universal NSNVC P system with 66 neurons is constructed as a function computing device.

scholarly journals Parallel communicating grammar systems with context-free components are Turing complete for any communication model

2016 ◽  
Vol 8 (2) ◽  
pp. 113-170
Author(s):  
Mary Sarah Ruth Wilkin ◽  
Stefan D. Bruda
Keyword(s):  
Concurrent Systems ◽  
Communication Model ◽  
Broadcast Communication ◽  
Turing Completeness ◽  
One Step ◽  
Grammar Systems ◽  
Turing Complete ◽  
Context Free ◽  
Original Construction ◽  
Parallel Communicating Grammar Systems

Abstract Parallel Communicating Grammar Systems (PCGS) were introduced as a language-theoretic treatment of concurrent systems. A PCGS extends the concept of a grammar to a structure that consists of several grammars working in parallel, communicating with each other, and so contributing to the generation of strings. PCGS are usually more powerful than a single grammar of the same type; PCGS with context-free components (CF-PCGS) in particular were shown to be Turing complete. However, this result only holds when a specific type of communication (which we call broadcast communication, as opposed to one-step communication) is used. We expand the original construction that showed Turing completeness so that broadcast communication is eliminated at the expense of introducing a significant number of additional, helper component grammars. We thus show that CF-PCGS with one-step communication are also Turing complete. We introduce in the process several techniques that may be usable in other constructions and may be capable of removing broadcast communication in general.

Properties of n-alcohol + n-alkane mixtures

1977 ◽  
Vol 30 (1) ◽  
pp. 43 ◽  
Author(s):  
F Smith
Keyword(s):  
P Systems ◽  
Effect Of Temperature ◽  
P System ◽  
Range Data ◽  
Free Energies ◽  
Dipole Term ◽  
Partial Molar Enthalpies ◽  
Refined Estimate ◽  
Two Parameters ◽  
Latent Heats

The total polar contributions (AP) to three properties [infrared absorbance, mixing enthalpies (HM) and excess free energies (GE)] of alcohol + alkane (alp) systems are separated into a direct hydrogenbond contribution ( AB) from the formation of isolated imers and a dipole-dipole contribution (AD) resulting from dipolar correlation between these transient imers. Dilute concentration range data giving the AB contributions to these properties were found dependent only on OH group concentration (c) and are used to show the serious inadequacies of previous theories. A new proposed association model having only two parameters, that are fixed for all systems, does give good results for the AB contributions and further is quite compatible with the effect of temperature change and with the n.m.r. chemical shift (ε) and apparent mean square dipole moment (p2) data that are also studied. Thus association theory has been made quantitative for the AB contributions to three properties of a/p systems and the approach given for deriving models appears capable of wider application. The model was used to extrapolate the AB contributions into the concentrated alcohol range to thus give the AD contributions by difference. The latter are then shown to be the origin of the distinctive behaviour shown by lower alcohols in their pure and binary mixture properties either with alkanes or with other alcohols where for the latter the principle of congruence is shown to be completely misleading. Two contributions (Ag and AD) explain the different c dependence shown by the i.r., HM and the δ data for a/p systems and, qualitatively, the HM data for alcohol+alcohol systems while the existence of a significant dipole term is strongly supported by the remarkable similarities found between the p2(c) data and the derived dipole-dipole contribution to the entropy of a/p systems. A method is given for predicting latent heats and partial molar enthalpies of higher alcohols from the HM data for one a/p system and a refined estimate is made of the enthalpy of formation of a hydrogen bond. Polar structure and non-linear dielectric effects are also discussed.

Sign in / Sign up

Export Citation Format

Share Document