On spiking neural P systems

DOI10.1007/s11047-009-9159-3zbMath1344.68077OpenAlexW1993641581MaRDI QIDQ5962071

Mario J. Pérez-Jiménez, Oscar H. Ibarra, Takashi Yokomori

Publication date: 16 September 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/69540

zbMATH Keywords

formal verificationuniversalityfinite automatonasynchronousfinite state transducersequentialspiking neural P systemsystolic trellis automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Asynchronous Extended Spiking Neural P Systems with Astrocytes ⋮ Computing with SN P systems with I/O mode ⋮ A return to stochasticity and probability in spiking neural P systems ⋮ Notes on spiking neural P systems and finite automata ⋮ Membrane automata for modeling biomolecular processes

Cites Work

• Unnamed Item
• Characterizations and computational complexity of systolic trellis automata
• Normal forms for spiking neural P systems
• Spiking neural P systems with extended rules: universality and languages
• Remarks on blind and partially blind one-way multicounter machines
• Some decision problems concerning semilinearity and commutation.
• Systolic trellis automata: Stability, decidability and complexity
• CHARACTERIZING REGULAR LANGUAGES BY SPIKING NEURAL P SYSTEMS
• Characterizations of Some Restricted Spiking Neural P Systems
• Spiking Neuron Models
• On Spiking Neural P Systems and Partially Blind Counter Machines
• Spiking Neural P Systems: Some Characterizations
• Asynchronous Spiking Neural P Systems: Decidability and Undecidability

This page was built for publication: On spiking neural P systems