Computing with SN P systems with I/O mode

P systems were introduced more than two decades ago by Gheorghe Pǎun. They are known as nondeterministic maximally parallel computing models. Most of their variants are proved to be capable of solving NP problems in polynomial time. This work focuses on using neural-like P systems to simulate unifor...

Full description

Saved in:
Bibliographic Details
Published inJournal of membrane computing Vol. 2; no. 4; pp. 230 - 245
Main Author Adorna, Henry N.
Format Journal Article
LanguageEnglish
Published Singapore Springer Singapore 01.12.2020
Subjects
Artificial Intelligence
Computation by Abstract Devices
Computational Biology/Bioinformatics
Computer Science
Optimization
Regular Paper
Theory of Computation
Spiking neural P Systems
Membrane computing
Automatic sequences
Deterministic finite automata with output
Online AccessGet full text
ISSN2523-8906
2523-8914
DOI10.1007/s41965-020-00059-7

Cover

More Information
Summary:P systems were introduced more than two decades ago by Gheorghe Pǎun. They are known as nondeterministic maximally parallel computing models. Most of their variants are proved to be capable of solving NP problems in polynomial time. This work focuses on using neural-like P systems to simulate uniform sequential computing models. In particular, we consider a so-called Spiking Neural P module (SN P module) computing finite-state functions. We define and characterize a so-called (SN) P automatic sequence by SN P modules.
ISSN:2523-8906
2523-8914
DOI:10.1007/s41965-020-00059-7