{'fraction_non_alphanumeric': 0.028368794326241134, 'fraction_numerical': 0.00425531914893617, 'mean_word_length': 5.139130434782609, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Decision problems for interacting finite state machines

Given a system of n interacting finite state machines (FSMs) and a state configuration, the reachability problem is to examine whether this configuration is reachable within the system. An investigation is made of the complexity of this decision problem and three of its derivatives, namely, (1) verifying system determination, (2) testing for the existence of unspecified inputs to any FSM within the system, and (3) testing for exclusiveness of two intra-FSM signals. It is proved that these problems are all PSPACE-complete. The effect of these problems on the state assignment process for concurrent systems of interacting FSMs is also shown. >