Closure properties MCQs

By: Prof. Dr. Fazal Rehman Shamil | Last updated: September 23, 2024

MCQs on Closure Properties of Languages
Which of the following closure properties holds for regular languages?

A) Closure under intersection with a context-free language
B) Closure under complementation
C) Closure under Turing reduction
D) Closure under context-sensitive languages
Answer: B) Closure under complementation

Which of the following is a property of context-free languages?

A) Closure under intersection with regular languages
B) Closure under Turing reduction
C) Closure under complementation
D) Closure under union with context-sensitive languages
Answer: A) Closure under intersection with regular languages

Which closure property holds for both regular and context-free languages?

A) Closure under complementation
B) Closure under intersection
C) Closure under Turing reduction
D) Closure under context-sensitive languages
Answer: B) Closure under intersection

Which of the following is NOT a closure property of regular languages?

A) Closure under concatenation
B) Closure under star operation (Kleene star)
C) Closure under intersection with regular languages
D) Closure under intersection with context-free languages
Answer: D) Closure under intersection with context-free languages

Which closure property is shared by regular, context-free, and context-sensitive languages?

A) Closure under union
B) Closure under intersection with regular languages
C) Closure under Turing reduction
D) Closure under complementation
Answer: A) Closure under union

Which closure property is specific to recursively enumerable languages?

A) Closure under union
B) Closure under complementation
C) Closure under intersection with regular languages
D) Closure under concatenation
Answer: B) Closure under complementation

True or False: Context-free languages are closed under intersection with context-sensitive languages.

A) True
B) False
Answer: B) False

Which of the following closure properties is true for all languages?

A) Closure under union
B) Closure under star operation (Kleene star)
C) Closure under intersection with context-free languages
D) Closure under Turing reduction
Answer: A) Closure under union

Which closure property is typically used in constructing new languages from existing ones in theoretical computer science?

A) Closure under Turing reduction
B) Closure under union
C) Closure under intersection with recursively enumerable languages
D) Closure under concatenation
Answer: D) Closure under concatenation

Which of the following closure properties implies that the resulting language is always computable?

A) Closure under union with recursively enumerable languages
B) Closure under intersection with context-free languages
C) Closure under star operation (Kleene star)
D) Closure under Turing reduction
Answer: C) Closure under star operation (Kleene star)

 

Related Posts: