Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs
| Published in: | Information processing letters Vol. 112, № 7. P. 298-301 |
|---|---|
| Main Author: | |
| Corporate Author: | |
| Other Authors: | , |
| Format: | Article |
| Language: | Russian |
| Subjects: | |
| Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000431850 Перейти в каталог НБ ТГУ |