The Gateway to Computer Science Excellence
+1 vote
93 views

Please Explain in detail.

in Theory of Computation by (449 points) | 93 views
0
i think... 2 languages are CFL..
0
In answers it is given 2.
0
Please explain in detail.
0
I think only last option given is CFL
0
why not L2?
+1
L2 has atleast  2 comparison
0
L2 is not CFL, Right!

1 Answer

0 votes
L2 and L4 will be CFL......as in L2 only j=k needs to be calculated while i and j are independent..........and in L4 first push a in stack and with each occurrence of b remove a if a=b then check for k to be even by pushing and popping c.....

So ans will be 2
by Active (1.2k points)
0
What about L3?

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,650 questions
56,208 answers
194,079 comments
95,113 users