效绵鼎 Example:PDA Design a PDA to accept {on1n |n1). The states: q=start state.We are in state q if we have seen only 0's so far. o p=we've seen at least one 1 and may now proceed only if the inputs are 1's. o f=final state;accept. .10Example: PDA ◼ Design a PDA to accept {0n1 n | n > 1}. ◼ The states:  q = start state. We are in state q if we have seen only 0’s so far.  p = we’ve seen at least one 1 and may now proceed only if the inputs are 1’s.  f = final state; accept. 10