Question

please explain thanks

Search 20:14 2. Let a, b, c, d). Express the next language on E as a regular expression. (10 points x 3 ) (1)A language consisting of words in which the number of b is 2 or 3 (2) A language consisting of words whose last character is a or b (3) A language consisting of words in which the letter following the letter a is always b 3. M (0, 1, 2), a, b}, 6, 0, {2}) d(0, a) (0, 1,d(1, a) {2} d(2, a) ¢ d(0,b)-(0),d(1,b){1},d(2,b)={2} illustrate the automaton M above. Does the automaton M accept the string abaa? Explain Does the automaton M accept the string babaab? Explain Does the automaton M accept the string babaaba? Explain Design a deterministic finite automaton that defines the same language as that defined by the automaton M

Answer 1

2)

1) Regular expression: (a + c + d)* . b . (a + c + d)* b . (a + c + d)* + (a + c + d)* . b . (a + c + d)* b . (a + c + d)* . b . (a + c + d)*

2) Regular expression: (a + b + c + d)* . ( a + b)

3) Regular expression: ((b + c + d)* . (ab)*) . (b + c + d)*)*

NOTE: As per Chegg policy, I am allowed to answer only 3 questions (including sub-parts) on a single post. Kindly post the remaining questions separately and I will try to answer them. Sorry for the inconvenience caused.