Open In App
Related Articles

GATE | GATE-CS-2007 | Question 74

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Consider the following Finite State Automaton. The language accepted by this automaton is given by the regular expression GATECS200774   GATECS200774ans (A) A (B) B (C) C (D) D

Answer: (C)

Explanation: In this case, we would at least have to reach q1 so that our string gets accepted. So, b* a is the smallest accepted string. Now, at q1, any string with any number of a’s and b’s would be accepted. So, we append (a + b)* to the smallest accepted string.
 
Thus, the string accepted by the FSA is b* a (a + b)*.
 
Thus, C is the correct choice.
 
Please comment below if you find anything wrong in the above post.

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads