search
Log In
1 vote
61 views
If L1 and L2 are non-regular, then L1⋃ L2 is also not-regular.

true or false?
in Theory of Computation 61 views
0
False.

1 Answer

0 votes
Take counter examples to disapprove in such questions
Let a^nb^m where n!=m be L1 and a^nb^m where n=m be L2.
Both are non regular infact dcfl to be precise but their union is
a*b* a regular language.

Related questions

2 votes
1 answer
1
390 views
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
asked Apr 30, 2019 in Theory of Computation srestha 390 views
0 votes
1 answer
2
307 views
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$
asked Apr 23, 2019 in Theory of Computation srestha 307 views
0 votes
3 answers
3
2k views
Consider $\left \langle M \right \rangle$ be the encoding of a turing machine as a string over alphabet $\Sigma =\left \{ 0,1 \right \}$. Consider $D=${$\left \langle M \right \rangle$ $M$ ... Recursive $(B)$ Non-Recursive $(C)$ Recursively enumerable $(D)$ Not Recursively enumerable My question is Is it not a Halting Problem they are asking for?
asked Apr 13, 2019 in Theory of Computation srestha 2k views
0 votes
0 answers
4
126 views
What is partial language?
asked Nov 21, 2018 in Theory of Computation amitqy 126 views
...