{'fraction_non_alphanumeric': 0.05384615384615385, 'fraction_numerical': 0.004615384615384616, 'mean_word_length': 4.380165289256198, '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 Order Reduction of Linear Functional Observers

This paper analyzes a new algorithm presented in [1] for designing a linear functional observer with arbitrary eigenvalues. It proves that the order of the observer in [1] is a reduction (depending on the problem) of a maximum order m=(¿l+...+¿p - p), where ¿i, i=l,...,p are the descending ordered observability indices of the system (A, C) and p is the number of the functionals. Therefore, the design algorithm in [1] is general for all cases in the design of both the functional observers as well as the state observers which can be regarded now as a special case of the functional observer.