Test Generation
baa, baaa, baaaa, babaaa,
bba, bbaa, bbaaa, bbbaaa,
baaa, baaaa, baaaaa, baabaaa,
baba, babaa, babaaa, babbaaa,
baaaa, baaaaa, baaaaaa, baaabaaa,
baaba, baabaa, baabaaa, baabbaaa,
baaaaa, baaaaaa, baaaaaaa, baaaabaaa,
baaaba, baaabaa, baaabaaa, baaabaaa
}
T
1
contains a total of 60 tests of which 20 are in S · W and 40
in S · X · W. To obtain T
2
, we note that R = P − S ={
a, bb
,
bab, baab, baaab, baaaa
}. T
2
can now be computed as follows:
T
2
= R · X[m − n] ⊗ W
= (R ⊗ W ) ∪ R · X ⊗ W )
R ⊗ W = ({
a
}·W
1
) ∪ ({
bb
}·W
4
) ∪ ({
baab
}·W
5
) ∪{
bab
}·W
1
∪
{
baaab
}·W
1
∪{
baaaa
}·W
5
={
abaaa, aaa, aa, bba, bbaaa, baaba, baabaaa
}
R · X W = (
aa
· W
1
) ∪ (
ab
· W
4
) ∪
(
bba
· W
3
(∪(
bbb
· W
4
) ∪
(
baaba
· W
2
) ∪ (
baabb
· W
5
)
(
baba
· W
1
) ∪ (
babb
· W
4
)
(
baaaba
· W
2
) ∪ (
baaabb
· W
5
)
(
baaaaa
· W
1
) ∪