Constructing deterministic finite-state automata in recurrent neural networks
- 1 November 1996
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 43 (6) , 937-972
- https://doi.org/10.1145/235809.235811
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The Dynamics of Discrete-Time Computation, with Application to Recurrent Neural Networks and Finite State Machine ExtractionNeural Computation, 1996
- Stable Encoding of Large Finite-State Automata in Recurrent Neural Networks with Sigmoid DiscriminantsNeural Computation, 1996
- Bounds on the complexity of recurrent neural network implementations of finite state machinesNeural Networks, 1996
- Rule revision with recurrent neural networksIEEE Transactions on Knowledge and Data Engineering, 1996
- Saturation at high gain in discrete time recurrent networksNeural Networks, 1994
- Learning Finite State Machines With Self-Clustering Recurrent NetworksNeural Computation, 1993
- Induction of Finite-State Languages Using Second-Order Recurrent NetworksNeural Computation, 1992
- Learning and Extracting Finite State Automata with Second-Order Recurrent Neural NetworksNeural Computation, 1992
- Neural Networks and the Bias/Variance DilemmaNeural Computation, 1992
- Efficient simulation of finite automata by neural netsJournal of the ACM, 1991