Handwritten notes

Question

a^m b^n where m+n=p how is this a cfl? Please explain. How will the stack be managed in this kind of language? 

2. also why can't cfl perform multiplication and subtraction? And why can't non linear languages like a^p, where p is a prime number, be accepted by pda. 

Comments

i mean to ask, " is there any information about p ?"

if p is a number or in any range, then it lead to regular language. ==> CFL too

 

why can't non linear languages like a^p, where p is a prime number, be accepted by pda. 

given that p is prime number, ===> 2,3,5,7,11,13,17,....

is there any relation, which can be preserved by STACK, if yes, then it is CFL, otherwise it is non-CFL.

We can show formally by using pumping lemma, that " this language not belongs to CFL ", but intuitively, it is sufficient !

---

okay i got that. please tell how L= a^m b^n where m+n=p; where p is any integer, how this will be a cfl and how stack would be implemented in this. i am not able to figure out the stack activity. @Shaik Masthan 

---

check this https://gateoverflow.in/169486/testbook-test-series