The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
In this paper, we address the problem of setting a deterministic Finite State Machine (FSM) to a designated initial state. Differently from other papers, we propose to use adaptive synchronizing sequences (test cases) for this purpose and show that for weakly-connected deterministic complete reduced...
| Опубликовано в: : | Information processing letters Vol. 127. P. 49-53 |
|---|---|
| Главный автор: | |
| Другие авторы: | , |
| Формат: | Статья в журнале |
| Язык: | English |
| Предметы: | |
| Online-ссылка: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000620771 Перейти в каталог НБ ТГУ |