An Approximate Method for Calculating the Distance Between Regular Languages for Multitape Finite Automata-Reference-Cited by-同舟云学术

An Approximate Method for Calculating the Distance Between Regular Languages for Multitape Finite Automata

Published:2020-12-25 Issue: Volume: Page:69-79
ISSN:2579-2784
Container-title:Mathematical Problems of Computer Science
language:en
Short-container-title:

Author:

Grigoryan Tigran¹

Affiliation:

1. Yerevan State University

Abstract

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.

Publisher

Institute for Informatics and Automation Problems - NAS RA

Subject

General Medicine

Reference13 articles.

1. M. O. Rabin and D. S. Scott, “Finite Automata and Their Decision Problems”, IBM J. Res. Dev., vol. 3, no. 2, pp. 114–125, 1959.

2. M. Bird, “The Equivalence Problem for Deterministic Two-Tape Automata”, J. Comput. Syst. Sci., vol. 7, no. 2, pp. 218–236, 1973.

3. T. Harju and J. Karhumaki, “The Equivalence Problem of Multitape Finite Automata”, Theor. Comput. Sci., vol. 78, no. 2, pp. 347-355, 1991.

4. B. G. Mirkin, ”On the theory of multitape automata”, Cybernetics, vol. 2, no. 5, pp. 9-14, 1966. doi:10.1007/BF01073664.

5. P. H. Starke, “On the Representability of Relations by Deterministic and Nondeterministic MultiTape Automata”, International Symposium on Mathematical Foundations of Computer Science, pp. 114-124, 1975.