search
Log In

Automata1.1 [closed]

0 votes
122 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
closed by
122 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
2
not always

but in this case.

Related questions

38 votes
8 answers
1
6.5k views
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals. $G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$ $G_{2}:S\rightarrow bSa \mid T, T \rightarrow cT \mid \epsilon$ The language $L\left ( G_{1} \right )\cap L(G_{2})$ is Finite Not finite but regular Context-Free but not regular Recursive but not context-free
asked Feb 14, 2017 in Theory of Computation Arjun 6.5k views
...