(A) Infinite
(B) Finite
(C) Distinct
(D) Non-distinct
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.
In new format of an FA This state is like dead-end non final state?
(A) ACCEPT
(B) REJECT
(C) STATR
(D) READ
TM is more powerful than FSM because?
(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
The part of an FA, where the input string is placed before it is run, is called?
(A) State
(B) Transition
(C) Input Tape
(D) Output Tape
__ states are called the halt states.
(A) ACCEPT and REJECT
(B) ACCEPT and READ
(C) ACCEPT AND START
(D) ACCEPT AND WRITE
The langue generated by CFG is called Context free language (CFL)?
(A) True
(B) False
(C) NA
(D) NA
“CFG” stands for __.
(A) Context Free Graph
(B) Context Free Grammar
(C) Context Finite Graph
(D) Context Finite Grammar
The regular expression thus obtained if contains at least one word then the language is not empty otherwise the language is__.
(A) Regular
(B) No regular
(C) Empty
(D) Non of the above