COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following statements is correct?
|
|
A = { If an bn | n = 0, 1, 2, 3 ..} is regular language
|
|
|
Set B of all strings of equal number of a’s and b’s deines a regular language
|
|
|
L (A* B*)∩ B gives the set A
|
|
|
None of these
|
Explanation:
There is 1 question to complete.