Abstract
The problem of simulation of automata by neural networks is investigated. In the case of discrete networks with polynomially bounded weights, the optimal lower and upper bounds for the number of neurons necessary to simulate any finite automata of size n are presented. For the analog case we prove the 15-neuron upper bound for any finite automaton. By extending this construction we show that a 25-neuron network may simulate any Turing machine, and hence its behavior is undecidable.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, A.K. Dewdney, T.J. Ott, Efficient simulation of finite automata by neural nets, Journal of ACM, vol. 38 (1991), 495–514.
M. Cosnard, M. Garzon, P. Koiran, Computability properties of low-dimensional dynamical systems, Proc. 10th Symp. on Theoretical Aspects of Computer Science (1993), LNCS 665, 365–373.
J. Hertz, A. Krogh, R. G. Palmer, Introduction to the theory of Neural Computation, Addison Wesley, Redwood City, CA (1991).
A. Hajnal, W. Maass, P. Pudlak, M. Szegedy anf G. Turan, Threshold circuits of bounded depth, Proc. 28th Annual IEEE Symp. on Foundations of Computer Science (1987), 99–110.
T. Hagerup and Ch. Rüb, A guided tour of Chernoff bounds, Inf. Proc. Letters 33 (1989/90), 305–308.
J. E. Hopcroft, J. D. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley (1979).
Y. Kamp, M. Hasler, Recursive neural networks for Associative Memory, John Wiley & Sons, Chichester (1990).
W. Maass, Bounds for the computational power and learning complexity of analog neural nets, Proc. 25th ACM symposium on Theory of Computing (1993), 335–344.
M. C. Mozer, Neural net architecture for temporal sequence processing (1993), to appear in A. Weigend, N. Gershenfeld (eds.), Predicting the future and understanding the past, Addison Wesley, Redwood City, CA.
A. Macintyre, E. D. Sontag, Finiteness results for Sigmoidal “Neural” Networks, Proc. 25th ACM Symp. on Theory of Computing (1993), 325–334.
W. Maass, G. Schnitger, E.D. Sontag, On the computational power of sigmoid versus boolean threshold circuits, Proc. 32nd Annual IEEE Symp. on Foundation of Computer Science (1991), 767–776.
P. Orponen, On the computational power of discrete Hopfield nets, Proc. 20th International Colloquium on Automata, Languages and Programming (1993).
P. Orponen, Neural Networks and Complexity Theory, Proc. 17th Symp. on Mathemathical Foundations of Computer Science (1992), 50–61.
I. Parberry, A primer on the complexity theory of neural networks, In: Formal techniques in artificial intelligence:A sourcebook (ed. R. B. Banerji), Eisevier-North-Holland, Amsterdam (1990), 217–268.
H.T. Siegelmann, E. D. Sontag, On the computational power of neural nets, Proc. Fifth ACM Workshop on Computational Learning Theory (1992), 440–449.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Indyk, P. (1995). Optimal simulation of automata by neural nets. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_85
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive