Journal ArticleDOI
On Languages Generated by Cell-Like Spiking Neural P Systems
TLDR
The computational power of cell-like spiking neural P systems as language generators is investigated, and characterization of recursively enumerable languages is obtained when there is no restriction on the number of produced spikes.Abstract:
Cell-like spiking neural P systems are a variant of standard spiking neural P systems, which have a cell-like instead of neural-like architecture. It has been proved that cell-like spiking neural P systems can generate Turing computable sets of numbers. In this work, the computational power of cell-like spiking neural P systems as language generators is investigated. Characterization of finite languages is obtained with cell-like spiking neural P systems when the number of spikes produced is less than the number of spikes consumed, and characterization of recursively enumerable languages is obtained by cell-like spiking neural P systems when there is no restriction on the number of produced spikes. The relationships of the languages generated by cell-like spiking neural P systems with regular, non-context-free and non-semilinear languages are also investigated.read more
Citations
More filters
Journal ArticleDOI
Spiking Neural P Systems With Scheduled Synapses
TL;DR: It is proved that SSN P systems are computationally universal as number generators and acceptors for both schedule types, under a normal form (i.e., a simplifying set of restrictions).
Journal ArticleDOI
An improved universal spiking neural P system with generalized use of rules
Yun Jiang,Yansen Su,Fen Luo +2 more
TL;DR: This work investigates the computational completeness of SNGR P systems and makes an improvement regarding to these related parameters, which provides an answer to the open problem mentioned in original work.
Journal ArticleDOI
Generating context-free languages using spiking neural P systems with structural plasticity
TL;DR: This work creates a procedure for constructing an SNPSP system given a context-free grammar in Greibach normal form (GNF), and essentially simulates the way in which a Context- free grammar in GNF is used to generate languages.
Journal ArticleDOI
Cell-Like Spiking Neural P Systems With Request Rules
TL;DR: The results show that the decrease of computation power caused by removing the internal functioning of producing more spikes and replicating spikes can be compensated by request rules, which suggests that the communication between a cell and the environment is an essential ingredient of systems in terms of computationPower.
Journal ArticleDOI
Automatic Implementation of Fuzzy Reasoning Spiking Neural P Systems for Diagnosing Faults in Complex Power Systems
TL;DR: An automatic implementation method for automatically fulfilling the hard task, named membrane computing fault diagnosis (MCFD) method is developed, which is a very significant attempt in the development of FRSN P systems and even of the membrane computing applications.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
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
Computation: Finite and Infinite Machines
TL;DR: In this article, the authors present an abstract theory that categorically and systematically describes what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment, and the abstract theory tells us in no uncertain terms that the machines' potential range is enormous and that its theoretical limitations are of the subtlest and most elusive sort.
Book
Membrane Computing: An Introduction
TL;DR: This chapter discusses Membrane Computing, What It Is and What It is Not, and attempts to get back to reality with open problems and Universality results.
Book
Introduction To Automata Theory, Languages And Computation, 3Rd Edition
TL;DR: The introduction to formal languages and automata wasolutionary rather than rcvolrrtionary and addressed Initially, I felt that giving solutions to exercises was undesirable hecause it lirrritcd the Chapter 1 fntroduction to the Theory of Computation.