{'fraction_non_alphanumeric': 0.013461538461538462, 'fraction_numerical': 0.0, 'mean_word_length': 4.788888888888889, '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}}
New algorithm for finding fixed points and cycles of Boolean network

Boolean networks have been successfully used in modeling biological systems. The fixed points, cycles and transient states that lead to them play an essential role to describe the structure of Boolean networks. In this paper we propose an algorithm to get all the fixed points and cycles of Boolean network by using the results of semi-tensor product and permutation. At last, an example is given to illustrate the efficiency of the obtained results.