(A) True
(B) False
(C) NA
(D) NA
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.
Closure of an FA, is same as __ of an FA with itself, except that the initial state of the required FA is a final state as well.
(A) Union
(B) Sum
(C) Concatenation
(D) Intersection
Considering FA1 and FA2 having 2 states each. Now FA1+FA2 can have maximum __ number of states.
(A) 2
(B) 3
(C) more than 3
(D) none of them
The CFG is said to be ambiguous if there exist at least one word of its language that can be generated by the __.
(A) One
(B) Two
(C) More than one
(D) At most one
The production of the form: Nonterminal-> ^ is said to be __ production.
(A) NULL
(B) UNIT
(C) Chomsky form production
(D) None of the given options
Which of the following states is not part of PDA?
(A) START
(B) ACCEPT
(C) WRTITE
(D) REJECT
The input string is placed, before it runs, in?
(A) Stack
(B) Memory
(C) Tape
(D) Ram
In polish notation, (o-o-o) is the abbreviation Of__?
(A) Operand – Operator – Operand
(B) Operand – Operand- Operator
(C) Operator -Operand – Operand
(D) Operand -Operand – Operand