{'fraction_non_alphanumeric': 0.012598425196850394, 'fraction_numerical': 0.0, 'mean_word_length': 4.578947368421052, '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}}
The three states functions : Foundations and complexity

In this article, we propose a study of the characteristics of the R.A NMJ algorithm which Is a new regenerator of pseudo-random sequences. The functions and classes of three states functions are fully used by the algorithm R.A NMJ to such a point that the theoretical analysis of the latter is connected to the one of the functions and the classes of functions. This analysis will study the linearity and injectivity of these three states functions as well as estimation on a collective complexity of the classes of the three states functions with the help of the MDS algorithm.