Computer Science Assignment | Homework For You
February 18th, 2020
. (20 pts) Give an example of each of the following. In all questions, the alphabet is {a,b}. If no example exists, answer “impossible”. No justification needed.

(a) A suffix of abbb of length 0.-El
(b) A string w where we = w alo ab – baby
(c) A finite automaton with two final states for the language {a}.
(d) A finite automaton with no final state for the language {a}.
(e) A GNFA that is not a NFA.
(f) A regular expression containing union, concatenation and Kleene star, for a finite language.
(g) A finite automaton where 8(91, a) = 42.
(h) A NFA with K = {90, 91, 92} and 8(91, a) = K.
(i) Two different equivalent regular expressions.
(j) Two different languages L, and L, such that L CL2. Get Computer Science homework help today