Sets of word tuples, accepted by multitape finite automata and a metric space for languages accepted by these automata, are considered. These languages are represented using the same notation as the known notation of regular expressions for languages accepted by one-tape automata. The only difference is the interpretation of the ”concatenation” operation in the notation. An algorithm is proposed for calculating the introduced distance between regular languages accepted by multitape finite automata.
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.
We consider sets of word tuples accepted by multitape finite automata. We use the known notation for regular expressions that describes languages accepted by one-tape automata. Nevertheless, the interpretation of the "concatenation" operation is different in this case. The algebra of events for multitape finite automata is defined in the same way as for one-tape automata. It is shown that the introduced algebra is a Kleene algebra. It is also, shown that some known results for the algebra of events accepted by one-tape finite automata are valid in this case too.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.