{'fraction_non_alphanumeric': 0.02702702702702703, 'fraction_numerical': 0.0, 'mean_word_length': 5.342342342342342, '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}}
Algorithms for set stabilisation of Boolean control networks

This study addresses two algorithms for set stabilisation of Boolean control networks (BCNs). Based on the semi-tensor product tool, the dynamics of BCNs can be characterised by its labelled digraph, which derived an graphical expression for the set stabilisation of BCNs. Then, two tree-search algorithms, namely, generalised breadth-first search and generalised depth-first search, are proposed for the first time to decide the controllers for the set stabilisation of BCNs. In addition, some properties concerning the tree search algorithm are proposed. Finally, an example is employed to show the application of the presented algorithms.