Register

A language is cfl or not

554 views
0 votes
0 votes

L = {a^(p+q) b^(p+q) a^p ,  p,q>=0}

Which one of the following is true about L?

  1. L is a regular
  2. L is CFL but not regular
  3. L is not a CFL
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.4k
views
1 answers
1 votes
sachin_27 asked Jun 1, 2022
1,420 views
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}if yes then why please explain
User Avatar
11.0k
views
3 answers
3 votes
sunil sarode asked Jul 11, 2017
10,967 views
Following language: L = {a^n b^n c^n d^n , n ≥ 1} ,How it is CSL and not CFL?
My understanding :We can create PDA as followsfor every 'a' push operation and on 'b' pop operation and again on 'c' push operation and on seeing 'd' pop operation.pleas...
User Avatar
729
views
0 answers
0 votes
hacker16 asked Dec 18, 2017
729 views
Given Language is Context free or Regular ?
Let Ʃ = {a, b} and L = {anwan | n ≥ 1, w ∈ Ʃ*}.ThenL is context free but not regularL is not context free but regularL is context free as well as regularL is neithe...
User Avatar
2.1k
views
2 answers
4 votes
amrendra pal asked Aug 27, 2017
2,079 views
regular and CFL language
Let A and B be two languages over alphabet ∑ . which of the following are true ? (more than one options may be correct)(a) if A is regular and B is CFL then A∩B is ...
User Avatar
Link Copied!