Home > Computer Engineering > Quizzes > Theory of Computer Science: Regular Expressions and Languages
Theory of Computer Science: Regular Expressions and Languages
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 74% • Most missed: “If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to…”
Theory of Computer Science: Regular Expressions and Languages
Time left 00:00
25 Questions

1. (a+b)* is equivalent to
2. Regular expression Φ* is equivalent to
3. Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product construction method, we have a machine M that accepts L1 ∩ L2. The total number of states in M:
4. Answer in accordance to the third and last statement in pumping lemma: For all _______ xyiz ∈L
5. Which among the following looks similar to the given expression? ((0+1). (0+1)) *
6. Regular expression {0,1} is equivalent to
7. Concatenation of R with Ф outputs:
8. A regular language over an alphabet a is one that can be obtained from
9. While applying Pumping lemma over a language, we consider a string w that belong to L and fragment it into _________ parts.
10. If L1 and L2'
11. Let w be a string and fragmented by three variable x, y, and z as per pumping lemma. What does these variables represent?
12. What does the symbol /z does?
13. Which of the following pair of regular expression are not equivalent?
14. Which of the following cannot be used to decide whether and how a given regexp matches a string:
15. Consider following regular expression: i) (a/b)* ii) (a*/b*)* iii) ((ϵ/a)b*)*. Which of the following statements is correct
16. a? is equivalent to
17. What kind of expressions do we used for pattern matching?
18. ΦL is equivalent to
19. Relate the following statement: Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.
20. Which among the following are the boolean operations that under which regular languages are closed?
21. Relate the following statement: Statement: All sufficiently long words in a regular language can have a middle section of words repeated a number of times to produce a new word which also lies within the same language.
22. Conversion of a regular expression into its corresponding NFA :
23. The following is/are an approach to process a regexp:
24. RR* can be expressed in which of the forms:
25. Which among the following is the closure property of a regular language?

⚡ Recently practiced quizzes in this topic
Live quiz activity
Information Technology Knowledge Test Computer Network MCQs General CS (Computer Science) Knowledge Test Big Data: NoSQL Green Computing Practice Test Natural Language Processing: Word Level Analysis Computational Thinking Concepts Computer Fundamentals Practice Test Operating Systems Practice Test: Introduction to OS Computer Fundamentals Practice Test: Generations of Computers
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.