search
Log In
0 votes
175 views

in Theory of Computation 175 views
0
Option B

This is NPDA for Set of odd length palindromes
0
It won't be accepting aa or bb ?
0

Yes manisha11  so we can eliminate options a,c,d

 

0
Please show how to do it. I already know the answer.
0

Sambhrant Maurya 

Below image should give you some clarification.

0
We would push S on A not A on S?
0
That's the trick here.

Ex:

We are in stare A and on input 'a' and top of stack as Z then we push aZ i.e. a is pushed on Z.

Please log in or register to answer this question.

Related questions

0 votes
2 answers
1
197 views
Among Deterministic pushdown automata and Non deterministic pushdown automata, which is more powerful and why ?
asked Oct 25, 2018 in Theory of Computation Shamim Ahmed 197 views
0 votes
1 answer
2
2 votes
1 answer
3
159 views
Which is more powerful :- 2-way Non-Deterministic Pushdown Machine(NDPDM) or 2-way Deterministic Pushdown Machine(DPDM) ? (or) Do both machine models have the same power ?
asked Mar 4, 2018 in Theory of Computation ankitgupta.1729 159 views
0 votes
1 answer
4
190 views
Consider Ldf set all languages accepted by DPDA by final state,Lef set of all languages accepted by DPDA by Empty stack Then A)Ldf proper subset of Lef. B)Ldf = Lef. C)Lef proper subset of Ldf. D)None .
asked Nov 6, 2018 in Theory of Computation Abhisek Tiwari 4 190 views
...