About simple conditional experiments identifying invertible automata of a certain class
It is shown that, for any class of strongly connected automata obtained from an initialized invertible automaton R by changing its transition function in dependence on a key, there exists an identifying experiment of a length not more than mn(m + 3)/2, where m and n are the numbers of states and input (output) symbols respectively in R.
Download file
Counter downloads: 203
Keywords
инициальный автомат, перестраиваемый автомат, обратимый автомат, сильносвязный автомат, идентификация автоматов, простые условные эксперименты, initialized automaton, invertible automaton, strongly connected automaton, automaton identification, simple adaptive experimentsAuthors
| Name | Organization | |
| Zhukovskaja A. O. | Tomsk State University | zhuka157@yandex.ru |
| Trenkaev V. N. | Tomsk State University | tvnik@sibmail.com |
References
About simple conditional experiments identifying invertible automata of a certain class | Applied Discrete Mathematics. Supplement. 2016. № 9.
Download full-text version
Counter downloads: 1385