(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
Category: Theory of Automata Mcqs
Theory of Automata Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Theory of Automata Mcqs portion from here.
‘Formal’ in formal languages means?
(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
One language can be expressed by more than one FA”. This statement is __.
(A) True
(B) False
(C) Some times true & sometimes false
(D) None of these
Left hand side of a production in CFG consists of?
(A) One terminal
(B) More than one terminal
(C) One non-terminal
(D) Terminals and non-terminals
Following is NOT a regular language?
(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
symbols that can’t be replaced by anything are called__.
(A) Terminal
(B) Non-Terminal
(C) Production
(D) All of given
Enters in a specific state but there is no way to leave it, then that specific state is called?
(A) Dead State
(B) Waste Basket
(C) Davey John Locker
(D) All of these
language?
(A) Must be finite
(B) Must be infinite
(C) Can be finite or infinite
(D) Must be finite and cannot be infinite