{'fraction_non_alphanumeric': 0.02268760907504363, 'fraction_numerical': 0.0034904013961605585, 'mean_word_length': 4.519230769230769, '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}}
On the Decidability of Checking Problems for CCS with Static μ-Operator ?

The paper considers the strong bisimilarity/similarity checking problems for CCS and CCS, two typical variants of CCS. The strong bisimilarity of the CCS/CCS processes is shown to be Π 1 -complete, even when the processes are restricted to the restriction prenex normal forms. The strong bisimilarity between a CCS/CCS process and a fixed regular process is also shown to be Π 1 -complete. The paper also establishes the decidability of the similarity problem of a regular process by a CCS process.