{'fraction_non_alphanumeric': 0.03582554517133956, 'fraction_numerical': 0.0, 'mean_word_length': 4.31404958677686, '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}}
N-structures applied to finite state machines

In this paper the notion of a N-finite state machine 
is introduced, as well as the concepts of a N-(immediate) 
successor, a N-exchange property and a N-subsystem are 
introduced. Some related properties are discussed. A condition 
for a N-finite state machine to satisfy the N-exchange property 
is established. A characterization of a N-subsystem is initiated. 
We prove that the isomorphism between N-finite state machines 
is an equivalence relation (resp. partial order relation). We then 
introduce the concept of N-complete finite state machine and 
discuss the isomorphism between them.