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

Q. Which of the following relates to Chomsky hierarchy?

View solution

Q. A language is accepted by a push down automata if it is:

View solution

Q. Which of the following is an incorrect regular expression identity?

View solution

Q. Which of the following strings do not belong the given regular expression?
(a)*(a+cba)

View solution

Q. Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.

View solution

Q. Which of the following strings is not generated by the given grammar:
S->SaSbS|e

View solution

Q. abb*c denotes which of the following?

View solution