Decidability
closed

vaishali jhalani asked Jan 27, 2017 • retagged Jun 4, 2017 by Arjun

233 views

See all

Related questions

1 votes

1 answer

Shamim Ahmed asked Jan 4, 2019

439 views

MadeEasy Test Series: Theory Of Computation - Decidability
Among II and III. Which one is decidable ? Please explain in detail.

Among II and III. Which one is decidable ? Please explain in detail.

Shamim Ahmed

439 views

Shamim Ahmed asked Jan 4, 2019

3 votes

3 answers

Hemanth_13 asked Dec 13, 2018

3,473 views

MadeEasy Subject Test 2019: Theory Of Computation - Decidability
Consider <M> be the encoding of Turing Machine as string over alphabet $\Sigma$ = {0,1}.Consider L= { <M>| M is TM that halt on all input and L(M) = L` for some undecidable language L` . Then L is Decidable and Recursive Decidable and non Recursive Undecidable and Recursive Undecidable and non Recursive

Consider <M be the encoding of Turing Machine as string over alphabet $\Sigma$ = {0,1}.Consider L= { <M>| M is TM that halt on all input and L(M) = L for some undecidab...

Hemanth_13

3.5k views

Hemanth_13 asked Dec 13, 2018

3 votes

0 answers

Sukhdip Singh asked Jan 16, 2018

618 views

MadeEasy Test Series 2018: Theory of Computation - Decidability
Consider the following statements: S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’. S2 : Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’. Which of the following is correct?

Consider the following statements:S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’.S2 : Concatenation of two d...

Sukhdip Singh

618 views

Sukhdip Singh asked Jan 16, 2018

4 votes

1 answer

♥_Less asked Nov 30, 2017

724 views

MadeEasy Subject Test: Theory of Computation - Decidability
1) L is undecidable 2) L is decidable 3) L is regular 4) none Answer given: 1) undecidable My solution: Since L(M) is reducible to a CFL language and since all CFL are recursive that means language accepted by M is ... halts on all inputs so this language will too and answer should be decidable. How to approach this type of question ?

1) L is undecidable2) L is decidable3) L is regular4) none Answer given: 1) undecidableMy solution: Since L(M) is reducible to a CFL language and since all CFL are recurs...

♥_Less

724 views

♥_Less asked Nov 30, 2017

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Decidability
closed

Please log in or register to add a comment.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

0 Answers

Related questions

0