edited by
914 views

3 Answers

0 votes
0 votes
bab is accepted by given FA but can not be generated by option A, B, and C

can be generated through D

Correct answer is D
0 votes
0 votes
A. Doesn't accept ba.

B. Doesn't accept ba. Also it produces aa not accepted by FA.

C. Doesn't accept a.

D. Correct.

So D is correct.
0 votes
0 votes
According to the given state transition diagram, the regular expression is
Step-1: Starting state has loop with symbol ‘b’ . It means, we can get n number of times ‘b’.
Step-2: The symbol ‘a’ between the starting state and end state. It means we can get only one
‘a’ after b*.
Step-3: The final state also having self loop with symbol ‘b’.

Answer-D
Answer:

Related questions

2 votes
2 votes
1 answer
3
Arjun asked Dec 7, 2018
1,060 views
In the Given language $L=\{ab, aa, baaa\}$, ____ number of strings are in $L^*$baaabaaabaaaabaaabaaaabaabaaabaaa $1$$2$$3$$4$
3 votes
3 votes
1 answer
4