### Abstract

We propose an algorithm for encoding deterministic finite-state automata (DFAs) in second-order recurrent neural networks with sigmoidal discriminant function and we prove that the languages accepted by the constructed network and the DFA are identical. The desired finite-state network dynamics is achieved by programming a small subset of all weights. A worst case analysis reveals a relationship between the weight strength and the maximum allowed network size, which guarantees finite-state behavior of the constructed network. We illustrate the method by encoding random DFAs with 10, 100, and 1000 states. While the theory predicts that the weight strength scales with the DFA size, we find empirically the weight strength to be almost constant for all the random DFAs. These results can be explained by noting that the generated DFAs represent average cases. We empirically demonstrate the existence of extreme DFAs for which the weight strength scales with DFA size.

Original language | English (US) |
---|---|

Pages (from-to) | 675-696 |

Number of pages | 22 |

Journal | Neural computation |

Volume | 8 |

Issue number | 4 |

DOIs | |

State | Published - May 15 1996 |

### All Science Journal Classification (ASJC) codes

- Arts and Humanities (miscellaneous)
- Cognitive Neuroscience