Tag: Theory of Automata

(A) The tape movement is confined to one direction
(B) It has no finite state control
(C) It has the capability to remember arbitrary long sequences of input symbols
(D) None of these

(A) The symbols used have well defined meaning
(B) They are unnecessary, in reality
(C) Only the form of the string of symbols is significant
(D) None of these

(A) True
(B) False
(C) Some times true & sometimes false
(D) None of these

(A) One terminal
(B) More than one terminal
(C) One non-terminal
(D) Terminals and non-terminals

(A) String of 0’s whose length is a perfect squere
(B) Set of all palindromes made up of 0’s and 1’s
(C) String of 0’s whose length is a prime number
(D) All of the given options

(A) Terminal
(B) Non-Terminal
(C) Production
(D) All of given

(A) Dead State
(B) Waste Basket
(C) Davey John Locker
(D) All of these

(A) Must be finite
(B) Must be infinite
(C) Can be finite or infinite
(D) Must be finite and cannot be infinite