Measurement of Distance Between Regular Events for Multitape Automata Based on a New Characterization of Equivalence Classes

Abstract

In this paper several problems related to the implementation of the method for the approximate calculation of distance between regular events for multitape finite automata are considered and resolved. An algorithm of matching for the considered regular expressions is suggested and results of the algorithm application to some specific regular expressions are adduced. The proposed method can be used not only for the mentioned implementation, but also separately.