edited by
572 views
2 votes
2 votes
(a^n)^m b^n where n>=0 and m>1 is

a) regular

b) cfl

c) csl

d) none
edited by

2 Answers

1 votes
1 votes
This is CFL ......

here it is clear that number of a should greater than b,because m>1 that means a should be there atleast 2 time or more.

PROCESS for pd:-

push a until b will come.

pop whenever b come.

now after finish b if there is a remain is should accepted otherwise if there is empty stack then not accepted.
0 votes
0 votes

it is cfl.

1)push for every a.

2)pop a for every b.

3)bypass a if it remains.

answer is B.

 

Related questions

0 votes
0 votes
0 answers
2
0 votes
0 votes
3 answers
3
!KARAN asked Jan 17, 2019
1,751 views
Let L = $\{ a^n b^m | m , n \in \textbf{N} \text{ and m is multiple of n}\}$How do we prove that this language is not CFL.
3 votes
3 votes
2 answers
4
kanahanin asked Dec 8, 2015
1,741 views
Is the language given by $ww^R ww^R$, where $w$ is any string over the binary alphabet, Context Free or Context Sensitive?