{'fraction_non_alphanumeric': 0.02494061757719715, 'fraction_numerical': 0.0, 'mean_word_length': 5.386363636363637, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Realization theory of recurrent neural networks and rational systems

In this paper, we show that, under mild assumptions, input-output behavior of a continuous-time recurrent neural network (RNN) can be represented by a rational or polynomial non-linear system. The assumptions concern the activation function of RNNs, and they are satisfied by many classical activation functions. We also present an algorithm for constructing the polynomial and rational system. This embedding of RNNs into rational systems can be useful for stability, identifiability, and realization theory for RNNs, as these problems have been studied for polynomial/rational systems. In particular, we use this embedding for deriving necessary conditions for realizability of an input-output map by RNN, and for deriving sufficient conditions for minimality of an RNN.