Finite-state computation in analog neural networks: steps towards biologically plausible models?

Authors:
Mikel L. Forcada;Rafael C. Carrasco
Affiliations:
Departament de Llenguatges i Sistemes Informàtics, Universitat d'Alacant, Alacant, Spain;Departament de Llenguatges i Sistemes Informàtics, Universitat d'Alacant, Alacant, Spain
Venue:
Emergent neural computational architectures based on neuroscience
Year:
2001

Citing 20
Cited 2

Backpropagation in perceptrons with feedback

Neural Computers
Efficient simulation of finite automata by neural nets

Journal of the ACM (JACM)
The Induction of Dynamical Recognizers

Machine Learning - Connectionist approaches to language learning
Learning and extracting finite state automata with second-order recurrent neural networks

Neural Computation
Induction of finite-state languages using second-order recurrent networks

Neural Computation
Learning and extracting initial mealy automata with a modular neural network model

Neural Computation
Learning the initial state of a second-order recurrent neural network during regular-language inference

Neural Computation
An algebraic framework to represent finite state machines in single-layer recurrent neural networks

Neural Computation
Bounds on the complexity of recurrent neural network implementations of finite state machines

Neural Networks
Representation of finite state automata in recurrent radial basis function networks

Machine Learning
Constructing deterministic finite-state automata in recurrent neural networks

Journal of the ACM (JACM)
Analysis of dynamical recognizers

Neural Computation
Theory of neuromata

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A theory of grammatical induction in the connectionist paradigm

A theory of grammatical induction in the connectionist paradigm
Computation: finite and infinite machines

Computation: finite and infinite machines
Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units

Neural Computation
The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction

Neural Computation
Inductive inference from noisy examples using the hybrid finite state filter

IEEE Transactions on Neural Networks
Gradient calculations for dynamic recurrent neural networks: a survey

IEEE Transactions on Neural Networks

Towards novel neuroscience-inspired computing

Emergent neural computational architectures based on neuroscience
Rule Extraction from Recurrent Neural Networks: A Taxonomy and Review

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, and constitute the best characterized computational model. On the other hand, neural networks --proposed almost sixty years ago by McCulloch and Pitts as a simplified model of nervous activity in living beings-- have evolved into a great variety of so-called artificial neural networks. Artificial neural networks have become a very successful tool for modelling and problem solving because of their built-in learning capability, but most of the progress in this field has occurred with models that are very removed from the behaviour of real, i.e., biological neural networks. This paper surveys the work that has established a connection between finite-state machines and (mainly discrete-time recurrent) neural networks, and suggests possible ways to construct finite-state models in biologically plausible neural networks.