reshown by
377 views
0 votes
0 votes

Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} .

L complement is

  1. Regular
  2. CFL but not regular
  3. CSL but not CSL
  4. DCFL
reshown by

1 Answer

Best answer
1 votes
1 votes
Actually the language L is CFL, and we know that CFL are not closed under Compliment and Intersection.

So compliment of given language will be CSL.
selected by

Related questions

1 votes
1 votes
0 answers
2
Sambhrant Maurya asked Oct 14, 2018
350 views
Let r1 = (b*ab*ab*ab*)* and r2= (b*ab*ab*)*. What is L(r1) ∩ L(r2)?a) L[b*ab*ab*ab*)*]b) L[b*ab*ab*)*]c) L[b*ab*ab*)6]d) L[b*ab*ab*ab*ab*ab*ab*)*]
0 votes
0 votes
0 answers
3
0 votes
0 votes
1 answer
4
Sambhrant Maurya asked Oct 14, 2018
657 views
If G= ({S} , {a}, {S ->SS} , S), then language L(G) isa)ϕb)aa(a)*c)(aa)*d)None of these