Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs

Похожие документы

• On the length of homing sequences for nondeterministic finite state machines
  по: Kushik, Natalia G.
• Homing sequences for nondeterministic finite state machines: on the exponential upper bound reachability
  по: Kushik, Natalia G.
• Some classes of finite state machines with polynomial length of distinguishing test cases
  по: Yenigün, Hüsnü
• Generating checking sequences for nondeterministic finite state machines
  по: Petrenko, Alexandre F.
• On separating UML specified non-deterministic finite state machines with time-outs
  по: Galimullin, Rustam