Register

TOC Test Series

246 views

1 Answer

0 votes
0 votes

If L1 and L2 are decidable then both the languages are recursive. And as recursive languages are closed under union L1 U L2 is also recursive. And L1 - L2 is also decidable.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
kaustubh7 asked Aug 24, 2023
390 views
made easy test series 2023 toc question
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
How many states are there in a minimum state DFA accepting the language number of 0’s is divisible by 2 and number of 1’s is divisible by 7, respectively?
User Avatar
1 votes
1 votes
1 answer
2
Souvik33 asked Dec 4, 2022
352 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
2 votes
2 votes
1 answer
3
Souvik33 asked Nov 23, 2022
320 views
CFL | TOC | Ace Academy Test Series
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
User Avatar
Link Copied!