Hardness of Deriving Invertible Sequences from Finite State Machines
From MaRDI portal
Publication:2971131
DOI10.1007/978-3-319-51963-0_12zbMath1444.68076OpenAlexW2568342859MaRDI QIDQ2971131
No author found.
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_12
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Relationships between nondeterministic and deterministic tape complexities
- Parallel Algorithms for Generating Harmonised State Identifiers and Characterising Sets
- On minimizing the lengths of checking sequences
- Reduced length checking sequences
- Testing Software Design Modeled by Finite-State Machines
- A Method for the Design of Fault Detection Experiments