144 views
1 votes
1 votes

construct a DPDA for this language is this a DCFL?           a^i b^j       such that  i!=2j+1 

my attempt: is for the first a I dont perform any action and then I start pushing 1 a for every 2a's but this is failing for i=2j+2 because it will have the same number of a's as i=2j+1

2j+2=1a for which we don't perform anything + j a's pushed on to the stack +1 a with no pair

2j+1 =1a for which we don't perform anything + j a's pushed on to the stack for rest of all the cases this is working fine except this please help

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Angkit asked Oct 1, 2017
269 views
∃x(p(x)∧q(x))⟹(∃xp(x)∧∃xq(x))a)It is false because ∃ is not distributive over ∧b) If we say LHS is false ,then then entire statement is true.WHICH ONE I C...
0 votes
0 votes
0 answers
2
Angkit asked Sep 29, 2017
226 views
The complement of a cycle on 25 vertices.is Eulerian ? Please explain.REF : https://gateoverflow.in/1221/gate2007-23
1 votes
1 votes
0 answers
3