Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
