retagged by
10,476 views
4 4 votes

Choose the correct statement -

  1. $A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ is a regular language
  2. The set $B$, consisting of all strings made up of only $a's$ and $b's$ having equal number of $a's$ and $bs$ defines a regular language
  3. $L(A^*B)\cap B$ gives the set $A$
  4. None of the above

3 Answers

Best answer
10 10 votes

option d  is right.

  • $^{a^nb^n}$ is DCFL but not reguler. so option a is false.
  • equal no of a's and equal no of b's is also DCFL but  not reguler.option b is false.
  •  L(A*B)$\cap$ B gives the set B. SO OPTION c is also false.
selected by
6 6 votes

(a) A={anbn| n=1,2..} is DCFL .So,(a) is False

(b)The set B,consisting of all strings made up of only a's and b's having equal number of a's and b's is a DCFL. So,(b) is False.

(c) L(A*B) $\cap$ B

A= {anbn| n=1,2..}

B=consisting of all strings made up of only a's and b's having equal number of a's and b's

L(A*B)= L( { B + AB + AAB + ...} )

Now, L(A*B) $\cap$ B = B

So,(c) is False.

Ans:(d) None of the above

edited by
Answer:
Position:
Show:

Related questions

4 4 votes
2 2 answers
2.4k
2.4k views
Arjun asked Apr 22, 2018
2,447 views
$CFG$ (Context Free Grammar) is not closed under: UnionComplementationKleene starProduct
4 4 votes
2 2 answers
10.2k
10.2k views
Arjun asked Apr 22, 2018
10,231 views
The $FSM$ (Finite State Machine) machine pictured in the figure aboveComplements a given bit patternFinds $2's$ complement of a given bit patternIncrements a given bit pa...
3 3 votes
3 3 answers
4.3k
4.3k views
Arjun asked Apr 22, 2018
4,303 views
A $CFG$ (Context Free Grammar) is said to be in Chomsky Normal Form $(CNF)$, if all the productions are of the form A$\to$ BC or A$\to$ a. Let $G$ be a $CFG$ in $CNF$. To...
11 11 votes
3 answers 3 answers
12.9k
12.9k views
Arjun asked Apr 22, 2018
12,861 views
Consider the following program{ int x=1; printf("%d",(*char(char*)&x)); }Assuming required header files are included and if the machine in which this program is executed ...