On the length of homing sequences for nondeterministic finite state machines
Published in: | Implementation and Application of Automata : 18th International Conference, CIAA 2013 Halifax, NS, Canada, July 16-19, 2013 : Proceedings P. 220-231 |
---|---|
Main Author: | Kushik, Natalia G. |
Corporate Authors: | Томский государственный университет Радиофизический факультет Кафедра информационных технологий в исследовании дискретных структур, Томский государственный университет Радиофизический факультет Научные подразделения РФФ |
Other Authors: | Yevtushenko, Nina V. |
Format: | Book Chapter |
Language: | English |
Subjects: | |
Online Access: | http://vital.lib.tsu.ru/vital/access/manager/Repository/vtls:000471151 Перейти в каталог НБ ТГУ |
Similar Items
-
Homing sequences for nondeterministic finite state machines: on the exponential upper bound reachability
by: Kushik, Natalia G. -
Generating checking sequences for nondeterministic finite state machines
by: Petrenko, Alexandre F. -
Some classes of finite state machines with polynomial length of distinguishing test cases
by: Yenigün, Hüsnü -
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs
by: Hwang, Iksoon -
On separating UML specified non-deterministic finite state machines with time-outs
by: Galimullin, Rustam