Register

test series

223 views

1 Answer

0 votes
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.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
2
Akash Chakraborty asked Jul 13, 2023
670 views
Practice Test Series Question
User Avatar
1 votes
1 votes
1 answer
3
Souvik33 asked Dec 4, 2022
346 views
TOC | Made Easy Test Series | Q.13
Consider the following statement S: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFL The above statement is: TRUE FALSE
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
User Avatar
0 votes
0 votes
0 answers
4
Pranavpurkar asked Nov 16, 2022
433 views
Test-Series
Consider the following language: $L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings } Which of the following is true about L? A)L is decidable B)L is Turing recognizable C)L is not recursive D)None of these
Consider the following language:$L$ $=$ { $<M>$ $|$ $L(M)$ has atleast $10$ strings }Which of the following is true about L?A)L is decidable ...
User Avatar
Link Copied!