In a pushdown automaton P=(Q,?,?,?,q0,F), a transition of the form,where p,q?Q, a???{?}, X,Y,???{?}, represents
(q,Y) ? ?(p,a,X)
Consider the following pushdown automaton over the input alphabet ?={a,b} and stack alphabet ?={#,A}.The number of strings of length 100 accepted by the above pushdown automaton is ___________ .
Correct Answer: A
report Report Error
Select Issue Type
Selected Issue
forum Community Discussion
speaker_notes_off
No discussions yet. Be the first to start!
syncLoading more...
You must be logged in to participate in the discussion.
Let LD be the set of all languages accepted by a PDA by final state and LF the set of all languages accepted by empty stack. Which of the following is true?
