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

asked in Theory of Computation by Active (2.1k points) | 76 views
0
$L_2$ and $L_4$ are CFL. Also DCFL
0
plz explain in detail
0
Is it correct?
0
yes,plz explain each one in detail
+3
$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
0
in L3 and L4 single comparison is required where as in L1,L2 two comparison is required
0
explain L2?
0
l2 is not dcfl its cfl only
0

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

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

0
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 Boss (10.9k points)

Related questions

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


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

39,715 questions
46,750 answers
140,560 comments
58,403 users