CS402 Assignment#1 Solution Spring 2018
Construct a regular expression (RE) defining each of the following languages over the alphabet
∑={a b}:
a) All words ends in 3 consecutive b.
R.E = (a+b)*bbb
b) All words having at least one ‘a’
R.E = (a+b)*a(a+b)
Construct an FA which recognizes the set of all strings defined over S = {x, y} starting with the prefix ‘xy’.
Link : https://vukhi01.blogspot.com/2018/05/...