Q. A context free grammar can be recognized by

View solution

Q. A null production can be referred to as:

View solution

Q. The context free grammar which generates a Regular Language is termed as:

View solution

Q. NPDA stands for

View solution

Q. The production of the form A->B , where A and B are non terminals is called

View solution

Q. Halting states are of two types. They are:

View solution

Q. A push down automata can be represented as:
PDA= ε-NFA +[stack]

State true or false:

View solution

Q. A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d)
What does the symbol z0 represents?

View solution

Q. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?

View solution

Q. Which among the following is true for the given statement?
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.

View solution

Q. Which of the following can be accepted by a DPDA?

View solution

Q. For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form of __________

View solution

Q. State true or false:
Statement: Counter Automaton can exist for the language L={0^i1^i|i>=0}

View solution

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