The Gateway to Computer Science Excellence

Automata1.1 [closed]

0 votes
97 views

Let $L_1$ and $L_2$ be languages over $\Sigma$ and assume that $L_1 \cap L_2 = \phi$. if $L_1$ is finite language and $L_1 \cup L_2$ is regular then $L_2$ is ____ ?

a. Regular language and finite

b. Regular language and infinite

c. Need not be regular

d. None of these. 

closed as a duplicate of: plz answer
in Theory of Computation by Active (3.2k points)
closed by | 97 views

1 Answer

+1 vote
As L1 is regular and  L1⋃L2 is regular then L2 must be regular as RL are closed under Union. But we can't say whether L2 is finite or infinite bcz it may be or may not be finite... Correct me if I am wrong
by Active (3.3k points)
+2
not always

but in this case.
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,292 answers
198,225 comments
104,909 users