(A) True
(B) False
(C) Some times true & sometimes false
(D) None of given
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.
The grammatical rules are often called__.
(A) Productions
(B) Terminals
(C) Non-terminals
(D) None of given
Let FA 3 be an FA accepting L1∩L2 then the initial stat of FA3 must be correspond to the initial state of__ and initial state of__.
(A) FA3, FA2
(B) FA1 , FA2
(C) FA1,FA3
(D) None of the given
Which of the following statement is NOT true?
(A) FA can be considered to be an NFA
(B) FA can be considered to be an NFA with null string
(C) NFA can be considered to be an TG
(D) TG can be considered to be an NFA
The symbols that must be replaced by other things are called?
(A) Productions
(B) Terminals
(C) Non-terminals
(D) None of given
“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
he symbols that can’t be replaced by anything are called__.
(A) Productions
(B) Terminals
(C) Non-terminals
(D) All of above
Consider the language L of strings, defined over Σ = ,a,b-, ending in a?
(A) There are finite many classes generated by L, so L is regular
(B) There are infinite many classes generated by L, so L is regular
(C) There are finite many classes generated by L, so L is non-regular
(D) There are infinite many classes generated by L, so L is non-regular