Question

Q3 Consider the following Pushdown Automata (the initial stack variable is $). 1, X 0,X 0,$ X → XX → X$ 1, $ → E 1, X → XX E,

0 0
Add a comment Improve this question Transcribed image text
Answer #1

The initial state is p.

First symbol is 0. 0,$ ->X$ . Push X onto stack and be on same state.

Second Symbol 0. 0,X->XX. Push X onto stack and be on same state.

Third symbol 1. 1,X->X. Don't do anything and stay on same state.

Fourth symbol 1. 1,X->X. Don't do anything and stay on same state.

Now after all symbol is over, we always have  to indicate end of string.

, X -> which means pop X from stack and go to state p.

This is how the given PDA will work.

If you have any questions comment down and please upvote thanks

Add a comment
Know the answer?
Add Answer to:
Q3 Consider the following Pushdown Automata (the initial stack variable is $). 1, X 0,X 0,$...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT