{'fraction_non_alphanumeric': 0.012168141592920354, 'fraction_numerical': 0.0, 'mean_word_length': 5.073825503355705, '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}}
Algorithm for Studying the Stability of Linear Systems with Many Delays

In this paper, an algorithm for researching the stability of linear systems using a computer is proposed. The stability of systems with delay is reduced to finding the limit conditions for the negatives of the real parts of the zeros of the corresponding quasi-polynomials. Verification in practice of such conditions is possible only in the simplest cases. The algorithm proposed in this paper is based on schemes for approximating linear systems with a delay by used sequence special of systems of linear ordinary differential equations. The equivalence of the exponential stability of systems with delay and of the proposed system of ordinary differential equations is established. This allowed us to build an algorithm for studying the location of non-asymptotic roots of quasi-polynomials, which are implemented on a computer.