Language generating alphabetic flat splicing P systems
Reads0
Chats0
TLDR
This work considers a P system with only alphabetic flat splicing rules as the evolution rules and strings of symbols as objects in its regions and shows that AFS P systems with two membranes are more powerful in generative power than AFSP systems with a single membrane.About:
This article is published in Theoretical Computer Science.The article was published on 2017-12-01 and is currently open access. It has received 6 citations till now.read more
Citations
More filters
Journal ArticleDOI
Derivation languages and descriptional complexity measures of restricted flat splicing systems
Prithwineel Paul,Kumar S. Ray +1 more
TL;DR: It is shown that any recursively enumerable language can be obtained as a control language of labeled restricted flat finite splicing systems of type ( 5 , 2 ) when λ-labeled rules are allowed.
Posted Content
On Derivation Languages of Flat Splicing Systems.
Prithwineel Paul,Kumar S. Ray +1 more
TL;DR: Any regular, context-free and recursively enumerable language can be represented as a homomorphic image of the Szilard language generated by the labeled flat splicing systems of type (1, 2); (2, 3) and (4,3) respectively.
Book ChapterDOI
Cortical Neural P Systems.
Zhongzheng Fu,Luping Zhang +1 more
TL;DR: In this paper, a variant of spiking neural P systems, cortical neural P system, is proposed in the frame work of P systems combining the topology structure of basic P system and information processing style in spiking neurons.
Posted Content
Derivation languages, descriptional complexity measures and decision problems of a class of flat splicing systems
Prithwineel Paul,Kumar S. Ray +1 more
TL;DR: It is shown that any recursively enumerable language can be obtained as a control language of labeled flat finite splicing systems of type $(4,2)$ when $\lambda$-labeled rules are allowed.
On homomorphic images of the Szilard languages of matrix insertion–deletion systems with matrices of size 2
TL;DR: In this paper, it was shown that any regular language can be represented as a homomorphic image of the Szilard language of matrix InsDel systems of size (2; 2, 2, 0, 0; 1, 1, 0), and that recursively enumerable languages can be obtained as the homomorphism of the SLL of matrix SLL with matrices of size 2.
References
More filters
Journal ArticleDOI
Computing with Membranes
TL;DR: It is proved that the P systems with the possibility of objects to cooperate characterize the recursively enumerable sets of natural numbers; moreover, systems with only two membranes suffice.
Book
The Oxford Handbook of Membrane Computing
TL;DR: This handbook provides both a comprehensive survey of available knowledge and established research topics, and a guide to recent developments in the field, covering the subject from theory to applications.
Book
DNA Computing: New Computing Paradigms
TL;DR: This book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory, and brings the reader to the most advanced theories develop thus far in this emerging research area.
Journal ArticleDOI
Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors.
TL;DR: This study initiates the formal analysis of the generative power of recombinational behaviors in general by means of a new generative formalism called a splicing system and a significant subclass of these languages, which are shown to coincide with a class of regular languages which have been previously studied in other contexts: the strictly locally testable languages.
BookDOI
Applications of membrane computing
TL;DR: In this article, the authors present a selective bibliography of Membrane Computing applications, including bio-applications, computer science applications, linguistics applications, and language applications.