in Theory of Computation reshown by
361 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
in Theory of Computation reshown by
by
361 views

1 comment

Complement shall be p!=q and q!=r

CSL it must be
1
1

1 Answer

1 vote
1 vote
Best answer
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

2 Comments

L is Non-deterministic context free right?
0
0

@balchandar reddy san Yes L is Non-Deterministic Context Free Language.

We generally use NDCFL as CFL only and Deterministic Context Free Language as DCFL.

0
0

Related questions