Give an example of a set S such that S only contains all-00870
This subjective question is related to the book/course
vu cs507 Information Systems.
It can also be found in
vu cs507 Mid Term Solved Past Paper No. 5.
Question 1: Give an example of a set S such that S* only contains all possible string of a's and b's that has length divisible by 3
Answer:
If S contains all possible strings of a & b of length 3, then all the words in S* will have length divisible by 3 and will include any concatenation of a's and b's (because S did).
By the product rule, there are 2*2*2 = 8 possible words of length 3:
S = {aaa aab aba baa abb bba bab bbb}
