Question: (i) Consider the language S*, where S = {aa ab ba bb}. Give another description of this language. (ii) Give an example of a set
(i) Consider the language S*, where S = {aa ab ba bb}. Give another description of this language.
(ii) Give an example of a set S such that S* only contains all possible strings of a's and b's that have length divisible by 3.
(iii) Let S b e all strings o f a's and b's with odd length. What is S*?
Step by Step Solution
3.49 Rating (176 Votes )
There are 3 Steps involved in it
i We know that every string in S must be divisible by 3 So if we replace each a or ... View full answer
Get step-by-step solutions from verified subject matter experts
