(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.
There is at least one production that has one __ on its left side.
(A) Terminal
(B) Infinite
(C) None Terminal
(D) All of above
The two FAs are?
(A) Same
(B) Equivalent
(C) Different
(D) None of them
NO154: For language L defined over {a, b},then L partitions {a, b}* into __ classes.
(A) Distinct
(B) Accept
(C) Unit production
(D) None of the above
If L1 and L2 are two regular languages then L1∩L2 is also?
(A) Regular
(B) None regular
(C) Finite
(D) None infinite
The same non terminals can be written in single line if they have more than one __.
(A) Productions
(B) Regular production
(C) None regular production
(D) None of them
An FA has same initial and final state, then it means that it has no final state?
(A) True
(B) False
(C) NA
(D) NA
Set of all palindromes over {a,b}is regular?
(A) True
(B) False
(C) NA
(D) NA