{'fraction_non_alphanumeric': 0.014527845036319613, 'fraction_numerical': 0.0, 'mean_word_length': 4.914285714285715, '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}}
Axiomatic Systems for the Bisimilarity on Finite Fair Ambient Processes

In this paper, we study an axiom system for the bisimilarity on finite Fair Ambient processes. In order to obtain normal forms of finite processes, we extended the syntax of Fair Ambient to put the nested ambient structure into prefixes. Upon our axiom system, if two finite Fair Ambient processes are equivalent can be effectively checked.