Question

1.   Write DFA, NFA (small), regular expression and right linear grammar for strings over {a,b}

a.   End in either aa or bb

b. ( aⁿ | bⁿa)   n >= 0

c. {w : w such that w contains the substring “bb” or w contains an odd number of a’s (or both).

d.   {w : w does not contain exactly two a’s}

e.   { w : w starts with substring abb and contains substring bba}

Answer 1

This is long assignment to do at once. Please post the remaining part seperately. We are not allowed to answer long assignment. Let me now if you have any doubt.

a.   End in either aa or bb

Regular expression: (a+b)*(aa|bb)

DFA:

e.   { w : w starts with substring abb and contains substring bba}

Regular expression: abb(a+b)*bba(a+b)*