Question
a.
R1 UNION R2 is regular
b.
R1 INTERSECTION R2 is regular
c.
∑ INTERSECTION R2 IS NOT REGULAR
d.
R2* IS NOT REGULAR
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Let R1 and R2 be regular sets defined over alphabet ∑ then
Similar Questions
Discover Related MCQs
Q. Which of the following strings can be obtained by the language L = { a^i b^2i / i≥ 1}?
View solution
Q. Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
View solution
Q. CFG is
View solution
Q. The idea of an automation with a stack as auxiliary storage
View solution
Q. Transition of finite automata is
View solution
Q. A context free language is called ambiguous if
View solution
Q. Which of the following identity is wrong?
View solution
Q. Finite automata has
View solution
Q. Finite automation and FSMS are used for
View solution
Q. In computer, finite automata program can be stored using
View solution
Q. A FA can be used for
View solution
Q. The palindromes can’t be recognized by a FA because
View solution
Q. Two – way finite automata has
View solution
Q. A FA with deterministic transitions capability is known as
View solution
Q. Limitation of a FA is
View solution
Q. How many DFA’s exist with three states over the input alphabet {0,1}?
View solution
Q. A FA with non – deterministic transitions capability is known as
View solution
Q. The behaviour of a NFA can be simulated by a DFA
View solution
Q. A NFA can be enhanced to move to a next state without reading the input tape.
View solution
Q. A FA having more than one reading head has
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
