Question 7918 – Theory-of-Computation
April 20, 2024
Question 8055 – Theory-of-Computation
April 20, 2024
Question 7918 – Theory-of-Computation
April 20, 2024
Question 8055 – Theory-of-Computation
April 20, 2024

Question 8053 – Theory-of-Computation

Which of the following languages is generated by the given grammar?

S→ aS|bS|ε

Correct Answer: D

Question 13 Explanation: 
From the given grammar we can draw the DFA,
A
{anbm |n,m ≥ 0}
B
{w ∈ {a,b}* | w has equal number of a’s and b’s}
C
{an |n ≥ 0}∪{bn |n ≥ 0}∪{an b(sup>n|n ≥ 0}
D
{a,b}*
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!