Spiking neurons and the induction of finite state machines.

DOI10.1016/S0304-3975(02)00099-3zbMath1061.92023MaRDI QIDQ1853470

Thomas Nathschläger, Wolfgang Maass

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Computational neuroscienceSpiking neuronsGrammatical inferenceFinite state machinesDynamic synapses

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural biology (92C20) Theory of computing (68Q99)

Related Items (4)

Modelling and analysing neural networks using a hybrid process algebra ⋮ On the computational power of circuits of spiking neurons ⋮ State-Dependent Computation Using Coupled Recurrent Networks ⋮ Learning Beyond Finite Memory in Recurrent Networks of Spiking Neurons

Cites Work

• Efficient temporal processing with biologically realistic dynamic synapses
• Lower Bounds for the Computational Power of Networks of Spiking Neurons
• Unnamed Item
• Unnamed Item

This page was built for publication: Spiking neurons and the induction of finite state machines.