search
Log In
0 votes
91 views

in Theory of Computation 91 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.

Related questions

0 votes
1 answer
1
44 views
Is 0^n 1^n 0^n 1^n where n>=0 a CFG ? Its given that its not CFG , please explain how ?
asked Dec 23, 2018 in Theory of Computation anurag sharma 44 views
0 votes
1 answer
2
52 views
L=0^i 1^j 2^k | i=j or j=k is the grammar DCFG?
asked Oct 23, 2018 in Theory of Computation aditi19 52 views
0 votes
0 answers
3
106 views
Consider the following CFG 'G' S--> aA/bSS/SS A--> aAb/bAa/AA/ε The language generated by G is: a)Set of all strings with atleast one 'a' b)Set of all strings with atleast two a's c)Set of all strings with atleast one more 'a' than number of b's d)None of these
asked Oct 18, 2018 in Theory of Computation Sambhrant Maurya 106 views
0 votes
1 answer
4
55 views
What is Non-Inheritant grammar and inheritant Grammar? Please explain with an example.
asked May 14, 2018 in Theory of Computation SreenivasaRaju 55 views
...