Q. Let ∑={0,1}* and the grammar G be:
S->ε

S->SS

S->0S1|1S0

State which of the following is true for the given

View solution

Q. The instantaneous PDA is has the following elements

View solution

Q. The moves in the PDA is technically termed as:

View solution

Q. Which of the following assertion is false?

View solution

Q. A push down automata can represented using:

View solution

Q. State true or false:
Statement: Every context free grammar can be transformed into an equvalent non deterministic push down automata.

View solution

Q. Which of the following are the actions that operates on stack top?

View solution

Q. A push down automata is said to be _________ if it has atmost one transition around all configurations.

View solution

Q. The transition a Push down automaton makes is additionally dependent upon the:

View solution

Q. A PDA machine configuration (p, w, y) can be correctly represented as:

View solution

Q. |-* is the __________ closure of |-

View solution

Q. With reference of a DPDA, which among the following do we perform from the start state with an empty stack?

View solution

Q. A DPDA is a PDA in which:

View solution

Q. State true or false:
Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.

View solution

Q. If the PDA does not stop on an accepting state and the stack is not empty, the string is:

View solution

Q. A language accepted by Deterministic Push down automata is closed under which of the following?

View solution

Q. Which of the following is a simulator for non deterministic automata?

View solution

Q. Finite-state acceptors for the nested words can be:

View solution

Q. Which of the following is analogous to the following?
:NFA and NPDA

View solution

Q. Let T={p, q, r, s, t}. The number of strings in S* of length 4 such that no symbols can be repeated.

View solution