Robust Implementaion of Finite Automata by Recurrent RBF Networks

Authors:
Michal Sorel;Jirí Síma
Affiliations:
-;-
Venue:
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Year:
2000

Citing 18
Cited 0

Radial basis functions for multivariable interpolation: a review

Algorithms for approximation
Efficient simulation of finite automata by neural nets

Journal of the ACM (JACM)
Training second-order recurrent neural networks using hints

ML92 Proceedings of the ninth international workshop on Machine learning
Learning and extracting finite state automata with second-order recurrent neural networks

Neural Computation
Learning finite machines with self-clustering recurrent networks

Neural Computation
On the node complexity of neural networks

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

Neural Computation
On the computational power of neural nets

Journal of Computer and System Sciences
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
The dynamic universality of sigmoidal neural networks

Information and Computation
Constructing deterministic finite-state automata in recurrent neural networks

Journal of the ACM (JACM)
Theory of neuromata

Journal of the ACM (JACM)
On the effect of analog noise in discrete-time analog computations

Neural Computation
Neural Networks: A Comprehensive Foundation

Neural Networks: A Comprehensive Foundation
Fast learning in networks of locally-tuned processing units

Neural Computation
First-order recurrent neural networks and deterministic finite state automata

Neural Computation
Computational power of neural networks: a characterization in terms of Kolmogorov complexity

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a recurrent network, which consists of O(√m log m) RBF (radial basis functions) units with maximum norm employing any activation function that has different values in at least two nonnegative points, is constructed so as to implement a given deterministic finite automaton with m states. The underlying simulation proves to be robust with respect to analog noise for a large class of smooth activation functions with a special type of inflexion.