{'fraction_non_alphanumeric': 0.018779342723004695, 'fraction_numerical': 0.0, 'mean_word_length': 5.597938144329897, '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}}
Prefix function view of states and events

Prefix functions are thought as a unifying concept for different ways of looking at discrete processes. The idea of prefix function consists in establishing relations between events and states; different types of such relations correspond to different ways of understanding states being reached in the course of computation. This concept covers such concurrent systems description tools as finite state automata, trees, Petri Nets, traces, occurring graphs, vector languages, multi-trees and similar. Special attention is paid to operations of contraction and synchronization on prefix functions.