The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote

asked in Theory of Computation by Loyal (2.7k points) | 71 views
$L_2$ and $L_4$ are CFL. Also DCFL
plz explain in detail
Is it correct?
yes,plz explain each one in detail
$L_2$ has both conditions i<=j and j>=i so it does not matter just check j = k.

$L_4$ match i with j and if you get empty stack after all b finished then check c for even by alternating push and pop
in L3 and L4 single comparison is required where as in L1,L2 two comparison is required
explain L2?
l2 is not dcfl its cfl only

no l2 is can be simply implemented using single stack....and deterministic transition...

l2 is just representing aibjck  ,j=k  ???

Good question.

1 Answer

0 votes
$L_{2}$ and $L_{4}$ both are DCFL. So answer is 2.

In $L_{2}$ we have to only check j==k or not.
answered by Veteran (14.7k points)

Related questions

+2 votes
0 answers
+2 votes
2 answers
+1 vote
1 answer

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

33,707 questions
40,253 answers
38,874 users