Test sequence construction using minimum information on the tested system
From MaRDI portal
Publication:2498283
DOI10.1007/s11086-005-0039-zzbMath1106.68090MaRDI QIDQ2498283
Publication date: 16 August 2006
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11086-005-0039-z
68R15: Combinatorics on words
Cites Work
- Unnamed Item
- Notes on de Bruijn sequences
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Strings with maximally many distinct subsequences and substrings
- Problems and algorithms for covering arrays
- A generalized recursive construction for de Bruijn sequences
- Algorithms for the generation of full-length shift- register sequences
- An efficient algorithm for the generation of DeBruijn cycles
- An algorithm for constructing m-ary de Bruijn sequences
- A new memoryless algorithm for de Bruijn sequences
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A Survey of Combinatorial Gray Codes
- A problem in arrangements
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- Permutations Arranged Around a Circle
- Normal Recurring Decimals
- Note on a Paper By I. J. Good