417 views
2 votes
2 votes
Given that a language L = L1 ∪ L2, where L1 and L2 are two other languages. If L is known to be a regular language, then which of the following statements is necessarily TRUE?
(a) If L1 is regular then L2 will also be regular
(b) If L1 is regular and finite then L2 will be regular
(c) If L1 is regular and finite the L2 will also be regular and finite
(d) None of these

1 Answer

Related questions

0 votes
0 votes
1 answer
1
practicalmetal asked Mar 25, 2023
374 views
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
1 votes
1 votes
1 answer
2
atulcse asked Jan 28, 2022
460 views
Which of the following languages is/are regular?
5 votes
5 votes
3 answers
3
Hirak asked May 25, 2019
1,738 views
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...