Constructing deterministic finite-state automata in sparse recurrent neural networks
Christian Walter Peter Omlin, Clyde Lee Giles · 2002
Presents an algorithm for encoding deterministic finite-state automata in sparse recurrent neural networks with sigmoidal discriminant functions and second-order weights. The authors prove that for particular weight strength values the regular languages accepted by DFAs and the constructed networks are identical.>