Abstract
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.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
