Prompt:
Design a Pushdown Automaton (PDA) recognizing the following
language, draw its state diagram.
Condition:
You can only push/pop one symbol into/from the stack one time upon
one input symbol
{w | w = 0n1n, n is odd}
Prompt Design A Pushdown Automaton Pda Recognizing The Following Language Draw Its State Diagram Condition You Can 1 (15.51 KiB) Viewed 32 times
does this PDA complete the conditions?
why not not or how can it be better? thank you!
0, E --->X દ,દ --->$ E, E --->E E, $ --->E 90 q1 92 94 1, X ---> 1, X ---> 93
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!