The Gateway to Computer Science Excellence
0 votes
56 views

in Theory of Computation by Junior (843 points) | 56 views
+1
Well, it is a CFL.
0
why not a pda a possible for this question.

NPDA is possible, please check it
0
How can u tell ??
0
atmost only one comparison required at a time.

right?
0
Yes
0

@Shaik Masthan  I don't understand how PDA can be constructed. Can you write the transition function or draw the PDA for the given problem?

0

@Deepalitrapti In the question is it i ≠ j and k ≠ 2l? Or what?

0
Yes condition same
+2
the question says i<>k "or" j<>2l. so its a cfl...
if it was "and" it wasnt a cfl..
+1

Thanks @arvin your solution is helpful.

Please log in or register to answer this question.

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,645 questions
56,596 answers
195,824 comments
102,077 users