NameMuhammad Hassan Hashmi ID Bc090400300

Q1. Solution a. Which of the following are strings generated from alphabet = {a, b} abba baa$a abc. ba? b.bba b. Which of the following are valid words for language of all strings ending with bab defined for alphabet = {a, c, bab} acccba0 cccbaa cccbab babbb baaab Q2. Solution 1. Having all strings starting with b and having length greater than 2 {baa, bab, bba, bbb, bba, baab, .. .. } 2. NOT having ab at any place. {^, a, b, ba, bab, bba, bbb, baa, bbba,..} Q3. Solution 1. Even Length strings ending with b {^ ,ab, bb, aabb, abab, bbbb, aaaabb, aaabab, } 2. Strings with bs count multiple of three {^, bbb, bbbbbb, bbbbbbbbb, bbbbbbbbbbbb, bbbbbbbbbbbbbbb, bbbbbbbbbbbbbbbbbb, bbbbbbbbbbbbbbbbbbbbb,} Q4. Solution 1. Language having all strings NOT containing aa at any place {^, a, b, ab, ba, abb, bab,bba, bbba, abbb, .} 2. Language of all strings NOT STARTING with bb {^, a, b, ab, aab, aaab, abab, aabab, .}

..