If The Pda Does Not Stop On An Accepting State And The Stack Is #525
If the PDA does not stop on an accepting state and the stack is not empty, the string is:
This multiple choice question (MCQ) is related to the book/course
gs gs101 Automata Theory.
It can also be found in
gs gs101 Push Down Automata - Deterministic PDA - Quiz No.1.
If the PDA does not stop on an accepting state and the stack is not empty, the string is:
rejected
goes into loop forever
all of the mentioned
none of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
