Theoretical Computer Science MCQ : Regular Language - Definition, Equivalence of FA and RE : Link1
Theoretical Computer Science MCQ & Answers
Are you worried about the answers to Theoretical Computer Science questions :Regular Language - Definition, Equivalence of FA and RE? We have arranged the Show Answer button under the each question. Candidates can click on it to know the right option among the given alternatives. Furthermore, the applicants can check our web portal @ www.totalmcq.com to take part in more MCQ on various subject. Wish, the given information about the Theoretical Computer Science MCQ will helpful to the advance and can learn the various types of questions and answers.
Q.1. Consider the languages L1 = 𝛟 and L2 = {a}. Which one of the following represents L1 L2* U L1*
A. {ε}
B. {ε, a}
C. 𝛟
D. a*
Q.2. Given the language L = {ab, aa, baa}, which of the following strings are in L*?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
A. 1, 2 and 3
B. 2, 3 and 4
C. 1, 2 and 4 D. 1, 3 and 4
Q.3. The set of all string over {a, b} of even length is represented by the regular expression-----
A. (ab+aa+bb+ba)*
B. (a+b)*(a*+b)*
C. (a+b)* D. (ab+ba)*
Q.4. L={a^2n | n>=1} is represented by the regular expression--------
A. (aa)*
B. a*
C. aa*a
D. a*a*
Q.5. Which of the following operation can be applied on regular expressions?
A. Union
B. Concatenation
C. Closure
D. All of the above
Q.6. Regular expressions are used to represent which language?
A. Recursive language
B. Regular language
C. Context free language
D. All of the above.
Q.7. The set of all strings over ∑ = {0,1} in which all strings that beings and ends with 0 is--------
A. 0(0+1)0
B. 00
C. 00(0+1)0
D. 00(0+1)11
Q.8. The set of all strings over ∑ = {a,b} in which all strings that starts with and ends with same letter is--------
A.[a(a+b)*b + b(a+b)*a]
B. [a(a+b)*a + b(a+b)*b]
C. a(a+b)*a
D. b(a+b)*b
Q.9.Regular expressions are used to represent which language?
A. Recursive language
B. Context free language
C. Regular language
D. All of the above.
Q.10. Which of the following statement is true?
A. Every language that is defined by regular expression can also be defined by finite automata
B. Every language defined by finite automata can also be defined by regular expression
C. We can convert regular expressions into finite automata
D. All of the above
Q.11. Which one of the following regular expression matches any string containing zero or one p?
A. p*
B. p+
C. p? D. p#
Q.12. Regular expression given NFA is------- 
A. 01* + 1
B. 01 + 1
C. 0 + 1
D. 01 + 1*
Q.13. A language is regular if and only if-------
A. accepted by DFA
B. accepted by PDA
C. accepted by Turing machine
D. accepted by LBA
Q.14. Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then---------
A. L1
C. L1 U L2 = .*
D. L1=L2
Q.15. Regular expression are----
A.Type 0 language
B. Type 1 language
C. Type 2 language D. Type 3 language