Bounds on the complexity of recurrent neural network implementations of finite state machines

In this paper we shall be concerned with Mealy machines, although our approach can easily be extended to other formulations to yield equivalent results.