Consider the language EVENBB consisting of all words of even length that contain the substring bb.

Give (i) an applicable universal set,

(ii) the generator(s),

(iii) an applicable function on the universal set, and

(iv) then use these concepts to write down a recursive definition for the language.

Answer rating: 100% (QA)

i Universal set In get theory a universal set is a set which contains all object including itself In ... View the full answer