Last Updated :
09 Nov, 2018
Consider the following regular expression:
b(a + b)* + ϵ + (a + b)*a
Which of the following finite automata will be the correct choice for given regular expression?
(A)
(B)
(C)
(D)
Answer: (C)
Explanation: Given regular expression is for the string which neither starts with a nor end with b. Finite automata machine for string which neither starts with a nor end with b:
So, option (C) is correct.
Quiz of this Question
Share your thoughts in the comments
Please Login to comment...