(A) Zero
(B) One
(C) More than One
(D) One OR more than One
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 __ machine helps in building a machine that can perform the addition of binary numbers.
(A) Incrementing
(B) Complementing
(C) Decrementing
(D) None of the given
In TG, there may be a transition for null string?
(A) True
(B) False
(C) Can’t show transition for string
(D) None of these
In drawing FA3 (which is equal to FA1 + FA2), a state will be declared final if?
(A) States of both FA’s are final
(B) At least one state is final
(C) Depends on language
(D) None of the given
In GTG’s there may exist no path for a certain string?
(A) True
(B) False
(C) Depends on alphabet
(D) None of these
In TG there may exist no paths for certain string?
(A) True
(B) False
(C) Depends on the language
(D) None of these
In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called?
(A) Dead States
(B) Waste Baskets
(C) Davey John Lockers
(D) All of these
Length of null string is?
(A) Always not equal to 0
(B) Always equal to 0
(C) It has variable length
(D) All are true