Question 1. Consider the alphabet I = {a.b.c} and the language L of all string in {a,b}' such that they do not contain t

[answerhappygod]

Question 1 Consider The Alphabet I A B C And The Language L Of All String In A B Such That They Do Not Contain T 1 (14.93 KiB) Viewed 53 times

please answer both the parts of the above question,
because these are related to each other, i can't post them
separately, its a short question . please solve as soon as
possible. i need them as soon as possible... Already posted answer
is not correct don't post the same answer, please solve yourself
.
Question 1. Consider the alphabet I = {a.b.c} and the language L of all string in {a,b}' such that they do not contain two b's in a row. For example, strings 2. a, b and abab are all in L, but the strings bb, abb, and bbad are not in L. а (a) Produce a DFA that accepts L. [3 marks] (b) Is your automaton complete? If yes, state why, and if not, then make it complete, [3 marks]