Hardness of Deriving Invertible Sequences from Finite State Machines (Q2971131): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Testing Software Design Modeled by Finite-State Machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5541342 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4165287 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On minimizing the lengths of checking sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Algorithms for Generating Harmonised State Identifiers and Characterising Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Method for the Design of Fault Detection Experiments / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reduced length checking sequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank | |||
Normal rank | |||
Latest revision as of 15:48, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of Deriving Invertible Sequences from Finite State Machines |
scientific article |
Statements
Hardness of Deriving Invertible Sequences from Finite State Machines (English)
0 references
4 April 2017
0 references
0 references
