gs gs101 Properties of Regular Languages - Closure Properties under Boolean Operations - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Properties of Regular Languages. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be ____________ under an operation op.
open
closed
decidable
none of the mentioned
Question 2: Suppose a regular language L is closed under the operation halving, then the result would be:
1/4 L will be regular
1/2 L will be regular
1/8 L will be regular
All of the mentioned
Question 3: If L1′ and L2′ are regular languages, then L1.L2 will be
regular
non regular
may be regular
none of the mentioned
Question 4: If L1 and L2′ are regular languages, L1 ∩ (L2′ U L1′)’ will be
regular
non regular
may be regular
none of the mentioned
Question 5: If A and B are regular languages, !(A’ U B’) is:
regular
non regular
may be regular
none of the mentioned
Question 6: Which among the following are the boolean operations that under which regular languages are closed?
Regular expression operations
Boolean operations
Homomorphism
Inverse Homomorphism
Question 8: If L is a regular language, then (L’)’ U L will be :
L
L’
f
none of the mentioned
Question 9: If L is a regular language, then (((L’)r)’)* is:
regular
non regular
may be regular
none of the mentioned
Question 10: Which among the following is the closure property of a regular language?
Emptiness
Universality
Membership
None of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
