Abstract
We present an algorithm for encoding deterministic finite-state automata in sparse recurrent neural networks with sigmoidal discriminant functions and second-order weights. We prove that for particular weight strength values the regular languages accepted by DFA's and the constructed networks are identical.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE International Conference on Neural Networks - Conference Proceedings |
| Publisher | IEEE |
| Pages | 1732-1737 |
| Number of pages | 6 |
| Volume | 3 |
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) - Orlando, FL, USA Duration: Jun 27 1994 → Jun 29 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) |
|---|---|
| City | Orlando, FL, USA |
| Period | 6/27/94 → 6/29/94 |
All Science Journal Classification (ASJC) codes
- Software