467 views

1 Answer

1 votes
1 votes
it is CFL because we have to count for a and b and at the end match against the constraint it should not exceed 10 it cannot be done with the finite automata.

Related questions

0 votes
0 votes
0 answers
1
saptarshiDey asked Jan 22, 2019
524 views
L = {a^(p+q) b^(p+q) a^p , p,q>=0}Which one of the following is true about L?L is a regularL is CFL but not regularL is not a CFL
2 votes
2 votes
0 answers
2
gari asked Jan 12, 2018
247 views
the condition is 1) (i<=j) or (j<=i) , j=k 2) (i<=j) or (j<=i) ,j=khow should we interpret the condition given ?
2 votes
2 votes
2 answers
3
focus _GATE asked Jan 10, 2017
505 views
L={ ai bj ck | i,j,k>=0, i<j<k}CFL OR NOT CFL ??