On the distinguishability of states of automata
Diskretnaya Matematika, Tome 15 (2003) no. 3, pp. 76-90
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We investigate variants of the notion of distinguishability of automata. The distinguishability in the sense of a given metric on the set of output symbols, the $k$-distinguishability and the $\infty$-distinguishability are considered. For each variant the exact value of the corresponding Shannon function is obtained. We find the minimum value of the parameter $k$ for which the $k$-distinguishability implies the $\infty$-distinguishability. The research was supported by the Russian Foundation for Basic Research, grant 02–01–00162.
[1] Mur E. F., “Umozritelnye eksperimenty s posledovatelnymi mashinami”, Avtomaty, IL, Moskva, 1956, 179–210
[2] Kudryavtsev V. B., Podkolzin A. S., Ushchumlich Sh. M., Vvedenie v teoriyu abstraktnykh avtomatov, Izd-vo MGU, Moskva, 1985
[3] Kudryavtsev V. B., Aleshin S. V., Podkolzin A. S., Elementy teorii avtomatov, Izd-vo MGU, Moskva, 1978 | Zbl