Q. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n.

View solution

Q. Push down automata accepts _________ languages.

View solution

Q. The class of languages not accepted by non deterministic, nonerasing stack automata is _______

View solution

Q. A push down automaton with only symbol allowed on the stack along with fixed symbol.

View solution

Q. Which of the operations are eligible in PDA?

View solution

Q. A string is accepted by a PDA when

View solution

Q. The following move of a PDA is on the basis of:

View solution

Q. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called

View solution

Q. Which among the following is not a part of the Context free grammar tuple?

View solution

Q. A context free grammar is a ___________

View solution

Q. The closure property of context free grammar includes :

View solution

Q. Which of the following automata takes stack as auxiliary storage?

View solution

Q. Which of the following automata takes queue as an auxiliary storage?

View solution

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