A look at the descriptional complexity of SNQ P systems

DOI10.1007/978-3-030-00265-7_18MaRDI QIDQ1709916zbMATH OpenOpenAlexFDO

Authors Andrei Păun, Florin-Daniel Bîlbîe

Publication date 15 January 2019

Full work available at URL https://doi.org/10.1007/978-3-030-00265-7_18

zbMATH Keywords

\(\mathrm{P}\) systemsdescriptional complexityregister machinesspiking neural networksuniversality

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Universality of SNQ P systems using one type of spikes and restrictive rule application
• Small SNQ P systems with multiple types of spikes
• Spiking Neural P Systems: Some Characterizations
• Characterizations of some classes of spiking neural P systems
• Spiking neural P systems

Cited in

(2)

• Universality of SNQ P systems using one type of spikes and restrictive rule application
• Membrane Computing

This page was built for publication: A look at the descriptional complexity of SNQ P systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709916)