Academic Resource
Aptitude
Data Interpretation
Verbal Reasoning
Non Verbal Reasoning
Verbal Ability
Programming
General Knowledge
Puzzle
Engineering
Computer Engineering
Electronics and Communication
Electrical Engineering
Mechanical Engineering
Civil Engineering
Biotechnology
Architecture & Planning
Online Test
Aptitude Test
Data Interpretation Test
Verbal Reasoning Test
Non Verbal Reasoning Test
Verbal Ability Test
Exams
More
Full Forms
Home
»
Theory of Computation
»
Theory of computation miscellaneous
» Question
Theory of computation miscellaneous
Easy Questions
Theory of Computation
Theory of computation miscellaneous
Which of the following languages is generated by the given grammar?
S → aS | bS | ε
{a
n
b
m
| n , m ≥ 0}
{w ∈ {a, b}*| w has equal number of a 's and b 's}
{a
n
| n ≥ 0} ∪ {b
n
| n ≥ 0} ∪ {a
n
b
n
|n ≥ 0}
{a,b}*
Correct Option:
D
NA
Previous Question
Next Question
Your comments will be displayed only after manual approval.
Post your Comment