Halting states are of two types. They are: – McqOptions

MCQOPTIONS

1.	Halting states are of two types. They are:
A.	Accept and Reject
B.	Reject and Allow
C.	Start and Reject
D.	None of the mentioned
Answer» B. Reject and Allow

Discussion

No Comment Found

Related MCQs

State true or false:<br>Statement: Counter Automaton can exist for the language L={0<sup>i</sup>1<sup>i</sup>|i>=0}
For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __________
Which of the following can be accepted by a DPDA?
Which among the following is true for the given statement?<br>Statement :If there are strings R and T in a language L so that R is prefix of T and R is not equivalent to T.
Which of the following correctly recognize the symbol |- in context to PDA?
A pushdown automata can be defined as: (Q, , G, q0, z0, A, d)<br>What does the symbol z0 represents?
A push down automata can be represented as:<br>PDA= -NFA +[stack]<br>State true or false:
Halting states are of two types. They are:
The production of the form A->B , where A and B are non terminals is called