III CSE A - FLA

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

• a) stack
  

• b) input tape
  

• c) terminals
  

• d) none of the mentioned

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

• a) (current state, unprocessed input, stack content)
  

• b) (unprocessed input, stack content, current state)
  

• c) (current state, stack content, unprocessed input)
  

• d) none of the mentioned

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

• a) process the whole string
  

• b) end in final state

• c) end with an empty stack
  

• d) all of the mentioned

A DPDA is a PDA in which:

• a) No state p has two outgoing transitions
  

• b) More than one state can have two or more outgoing transitions
  

• c) Atleast one state has more than one transitions
  

• d) None of the mentioned

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

• a) rejected
  

• b) goes into loop forever
  

• c) all of the mentioned
  

• d) none of the mentioned

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

• a) Complement
  

• b) Union
  

• c) All of the mentioned
  

• d) None of the mentioned

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

• a) regular
  

• b) context free
  

• c) regular and context free
  

• d) none of the mentioned

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

• a) aa
  

• b) aaa
  

• c) acba
  

• d) acbacba

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

• a) aabb
  

• b) abab
  

• c) abaabb
  

• d) None of the mentioned

The following denotion belongs to which type of language:
G=(V, T, P, S)

• a) Regular grammar
  

• b) Context free grammar
  

• c) Context Sensitive grammar
  

• d) All of the mentioned