Register

Decidability Problem
closed

• closed by
127 views
0 votes
0 votes
closed as a duplicate of: What is the difference ??

Consider the following language:

Which of the following is correct above languages?

  • L1 is recursive language
  • L2 is recursive enumerable language
  • Both (a) and (b)
  • Both are not recursive enumerable
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
baofbuiafbi asked Nov 14, 2023
147 views
Michael Sipser Decidability Problem
Is the following language decidable or not? If you deem it decidable, you need to give an algorithm and analyse its running time. If not decidable, you need to prove it. L = {M | M is a Turing machine and L(M) ∈ TIME(2^n)}
Is the following language decidable or not? If you deem it decidable, you need to give an algorithm and analyse its running time. If not decidable, you need to prove it. ...
User Avatar
3 votes
3 votes
2 answers
2
Mk Utkarsh asked Sep 14, 2018
1,073 views
Decidability (Acceptance problem)
Whether the given languages are recursive, recursively enumerable or non RE 1) $L = \left \{ <M> | <M> \ accepts \ all \ strings \ of \ length \ at \ most \ 5 \right \}$ 2) $L = \left \{ <M> | <M> \ accepts \ strings \ of \ length \ at \ most \ 5 \right \}$
Whether the given languages are recursive, recursively enumerable or non RE1) $L = \left \{ <M | <M \ accepts \ all \ strings \ of \ length \ at \ most \ 5 \right \}$2) $...
User Avatar
0 votes
0 votes
0 answers
3
garg div asked Nov 30, 2017
271 views
Decidability Problem
S1 : Given a context free grammar G, there exists an algorithm for determining whether L(G) is finite. S2 : Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite. Which of the above statement is true? Please explain
S1 : Given a context free grammar G, there exists an algorithm for determiningwhether L(G) is finite.S2 : Given a context free grammar G, there exists an algorithm for de...
User Avatar
2 votes
2 votes
1 answer
4
KISHALAY DAS asked Dec 14, 2016
598 views
ACE-MockTest2:Turing Machine Decidability Problem
User Avatar
Link Copied!