(A) Non-regular
(B) Equal
(C) Regular
(D) Infinite
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.
Let Q = {aa, abaaabb, bbaaaaa, bbbbbbbbbb} and R = {b, bbbb, bbbaaa, bbbaaaaa} Pref (Q in R) is equal to?
(A) {b,bbba,bbbaaa}
(B) {b,bba,bbaaa}
(C) {ab,bba,bbbaa}
(D) {b,bba,bbba}
If two languages R and Q are given, then the prefixes of Q in R denoted by Pref(Q in R)?
(A) True
(B) False
(C) NA
(D) NA
The language Q is said to be quotient of two regular languages P and R, denoted by— if PQ=R?
(A) R=Q/P
(B) Q=R/P
(C) Q=P/R
(D) P=R/Q
Myhill Nerode theorem is consisting of the followings?
(A) L partitions Σ* into distinct classes
(B) If L is regular then, L generates finite number of classesIf L is regular then, L generates finite number of classes
(C) If L generates finite number of classes then L is regular
(D) All of above
If, two strings x and y, defined over Σ, are run over an FA accepting the language L, then x and y are said to belong to the same class if they end in the same state, no matter that state is final or not?
(A) True
(B) False
(C) NA
(D) NA
If L1 and L2 are expressed by regular expressions r1 and r2, respectively then the language expressed by r1 + r2 will be __.
(A) Ir-regular
(B) Can’t be decided
(C) Regular language
(D) Another Language which is not listed
__ is obviously infinite language.
(A) EQUAL-EQUAL
(B) EVEN-EVEN
(C) PALINDROME
(D) FACTORIAL