Pages that link to "Item:Q613138"
From MaRDI portal
The following pages link to Lower bounds on lengths of checking sequences (Q613138):
Displaying 10 items.
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Testing finite state machines: Fault detection (Q1892217) (← links)
- Reduced checking sequences using unreliable reset (Q2339596) (← links)
- Length lower bounds for reflecting sequences and universal traversal sequences (Q2407040) (← links)
- Conformance testing in the presence of multiple faults (Q2921787) (← links)
- On minimizing the lengths of checking sequences (Q3417008) (← links)
- Checking Big Suffix and LCP Arrays by Probabilistic Methods (Q4567209) (← links)
- Lower bounds for the length of test sequences using UIOs (Q4698227) (← links)
- (Q4857241) (← links)