Optimal simulation of automata by neural nets
- 1 January 1995
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 337-348
- https://doi.org/10.1007/3-540-59042-0_85
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Bounds for the computational power and learning complexity of analog neural netsPublished by Association for Computing Machinery (ACM) ,1993
- Finiteness results for sigmoidal “neural” networksPublished by Association for Computing Machinery (ACM) ,1993
- On the computational power of discrete Hopfield netsLecture Notes in Computer Science, 1993
- On the computational power of neural netsPublished by Association for Computing Machinery (ACM) ,1992
- Neural networks and complexity theoryLecture Notes in Computer Science, 1992
- Efficient simulation of finite automata by neural netsJournal of the ACM, 1991
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Threshold circuits of bounded depthPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987