Pages that link to "Item:Q413312"
From MaRDI portal
The following pages link to Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (Q413312):
Displaying 4 items.
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation (Q1707350) (← links)
- (Q4966026) (← links)
- On the Length of Homing Sequences for Nondeterministic Finite State Machines (Q5327497) (← links)