![Question 881 – Nielit Scentist-B [02-12-2018]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
Binary-Trees
November 5, 2023Computer-Networks
November 5, 2023Question 881 – Nielit Scentist-B [02-12-2018]
Consider the following finite state automaton. The language accepted by this automaton is given by the regular.
Correct Answer: D
Question 5 Explanation:
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’.
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’.
ab*b*
a*b*
b*b
b*ab*
Subscribe
Login
0 Comments