Question

Consider e PDA drawn below: Write out the formal description of the DA Exibit a computation path that accepts the input DDIOl" by atin uhot the State te and conterts of the Stack are at the besninga n and after each tran sit oper otes .Tnformally explain-lowths-FDA using Enelis leat lanayoape is recomyuized by tde PDa?

Answer 1

Solution:

Formal description:

The above given PDA is accepting the input strings which are containing more 0's than 1's in the input string.

for input string 00101 the

initially, there will be $ in the stack

at input 0, 0 will be pushed into the stack

at input 0 again 0 will be pushed into the stack

at 1 one 0 will be popped out and now that stack has $ in it

at input 1 nothing will happen and the input string will get rejected.

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)