Geodesic
A complete solution of the minimisation problem for a set of binary two-tape automata
Diskretnaya Matematika, Tome 22 (2010) no. 3, pp. 146-159 
R. I. Podlovchenko; V. E. Khachatryan. A complete solution of the minimisation problem for a set of binary two-tape automata. Diskretnaya Matematika, Tome 22 (2010) no. 3, pp. 146-159. http://geodesic.mathdoc.fr/item/DM_2010_22_3_a12/
@article{DM_2010_22_3_a12,
     author = {R. I. Podlovchenko and V. E. Khachatryan},
     title = {A complete solution of the minimisation problem for a~set of binary two-tape automata},
     journal = {Diskretnaya Matematika},
     pages = {146--159},
     year = {2010},
     volume = {22},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2010_22_3_a12/}
}
TY  - JOUR
AU  - R. I. Podlovchenko
AU  - V. E. Khachatryan
TI  - A complete solution of the minimisation problem for a set of binary two-tape automata
JO  - Diskretnaya Matematika
PY  - 2010
SP  - 146
EP  - 159
VL  - 22
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DM_2010_22_3_a12/
LA  - ru
ID  - DM_2010_22_3_a12
ER  - 
%0 Journal Article
%A R. I. Podlovchenko
%A V. E. Khachatryan
%T A complete solution of the minimisation problem for a set of binary two-tape automata
%J Diskretnaya Matematika
%D 2010
%P 146-159
%V 22
%N 3
%U http://geodesic.mathdoc.fr/item/DM_2010_22_3_a12/
%G ru
%F DM_2010_22_3_a12

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper we complete the solution of the minimisation problem for a set of binary two-tape automata. The beginning of the solution was published in Discrete Mathematics and Applications 18 (2008), pp. 271–292. The minimisation problem consists of finding all minimal automata in each equivalence class of a considered set. The search is performed by means of equivalent transformations of automata. The solution of the problem is based on an appropriate partition of the equivalence class.

[1] Podlovchenko R. I., Khachatryan V. E., “Minimalnost i tupikovost mnogolentochnykh avtomatov”, Diskretnaya matematika, 20:2 (2008), 100–121 | Zbl

[2] Podlovchenko R. I., “K voprosu ob ekvivalentnykh preobrazovaniyakh algoritmov i programm”, Matematicheskie voprosy kibernetiki, 9, 2000, 25–36 | MR

[3] Khachatryan V. E., “Reshenie obobschennoi problemy minimizatsii dlya dvukhlentochnykh avtomatov s odnoi fiksirovannoi lentoi”, Doklady RAN, 411:3 (2006), 314–318 | MR