edited by
363 views

1 Answer

1 votes
1 votes
d. CSL

    Since, the substring xy cannot be determined using a PDA, the above language is a context sensitive language. Had xy been a finite string containing a or b, then it would have been a deterministic CFL.

Related questions

0 votes
0 votes
0 answers
1
jatin khachane 1 asked Oct 14, 2018
577 views
If L1 is CFL and L2 is Regular L.$L1\cap L2 = L3$ Then L3 is CFL.Can L3 be regular also sometimes and if L3 is CFL and Regular also does it employs L1 is also Regular ??
1 votes
1 votes
2 answers
2
1 votes
1 votes
1 answer
4