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

CSL it must be

CSL it must be

The Gateway to Computer Science Excellence

0 votes

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

L complement is

- Regular
- CFL but not regular
- CSL but not CSL
- DCFL

+1 vote

Best answer

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.

52,218 questions

59,876 answers

201,071 comments

118,119 users