Identification of a specific limitation on local-feedback recurrent networks acting as Mealy-Moore machines

@article{Kremer1999IdentificationOA,
  title={Identification of a specific limitation on local-feedback recurrent networks acting as Mealy-Moore machines},
  author={Stefan C. Kremer},
  journal={IEEE transactions on neural networks},
  year={1999},
  volume={10 2},
  pages={433-8}
}
This paper describes a proof which identifies limitations of local-feedback recurrent networks (LFRN's) in representing Mealy-Moore machines. Specifically, it identifies a class of machines that are unrepresentable in these networks. While it is known that LFRN's cannot represent all automata, this is the first paper to show a specific class of unrepresentable automata. The paper goes beyond previous work in the area by addressing realistic activation functions, arbitrary network architectures… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…