Discrete Applied Mathematics
Algorithms for De Bruijn sequences—a case study in empirical analysis of algorithms
The Computer Journal - Special issue on safety and security parallel computation
Generating De Bruijn Sequences: An Efficient Implementation
IEEE Transactions on Computers
A Survey of Combinatorial Gray Codes
SIAM Review
Shift Register Sequences
A New Optimised De Bruijn Coding Strategy for Structured Light Patterns
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
| Hi-index | 0.00 |
In the paper, approaches to constructing test sequences are considered in the case where only admissible input actions on the system are known, whereas no information about the states of the system or transitions between them in response to these actions is available. Two approaches to constructing test sequences that guarantee the widest variety of situations arising in the course of testing are suggested. The first approach gives rise to the so-called de Bruijn sequences. The second approach yields sequences covering all states or transitions in all finite automata with the number of states not exceeding a given constant. Both kinds of sequences are related to the combinatorial analysis of words in finite alphabets. Some methods for constructing such sequences are also discussed.