Consider the language oddnotab consisting of all words that do not contain the substring ab and that are of odd length. (0) an applicable universal set (ii) the generator(s), (ili) an applicable function on the universal set and (iv) then use these concepts to write down a recursive definition for the language give

answer; ///i do believe that the correct answer is (condition and action); /

you have to email it to yourself from your phone then download it to either google drive or you computer files. then you can go to where ever you saved it and select it and then copy and paste it. or you could attach it to your question when you are writing it which would be much easier. for example: go to the attachment.

i think the answer is b.