Q.1
The production of the form A->B , where A and B are non terminals is called
  • a) Null production
  • b) Unit production
  • c) Greibach Normal Form
  • d) Chomsky Normal Form
Q.2
Halting states are of two types. They are:
  • a) Accept and Reject
  • b) Reject and Allow
  • c) Start and Reject
  • d) None of the mentioned
Q.3
A push down automata can be represented as:
  • a) true
  • b) false
Q.4
A pushdown automata can be defined as: (Q, ∑, G, qzA, d)
  • a) an element of G
  • b) initial stack symbol
  • c) top stack alphabet
  • d) all of the mentioned
Q.5
Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
  • a) Moves
  • b) transition function
  • c) or/not symbol
  • d) none of the mentioned
Q.6
Which among the following is true for the given statement?
  • a) No DPDA can accept L by empty stack
  • b) DPDA can accept L by an empty stack
  • c) L is regular
  • d) None of the mentioned
Q.7
Which of the following can be accepted by a DPDA?
  • a) The set of even length palindrome over {a,b}
  • b) The set of odd length palindrome over {a,b}
  • c) {xxc| where c stands for the complement,{0,1}}
  • d) None of the mentioned
Q.8
For a counter automaton, with the symbols A and Zthe string on the stack is always in the form of __________
  • a) A
  • b) AnZ0, n>=0
  • c) Z0An, n>=0
  • d) None of the mentioned
Q.9
State true or false:
  • a) true
  • b) false
Q.10
Let ∑={0,1}* and the grammar G be:
  • a) Language of all and only Balanced strings
  • b) It contains equal number of 0’s and 1’s
  • c) Ambiguous Grammar
  • d) All of the mentioned
0 h : 0 m : 1 s