Which of the following language is decidable?
closed

target2017 asked Nov 19, 2016 • closed Nov 19, 2016 by Kapil

402 views

0 votes

closed as a duplicate of: Which of the following languages are Recursively Enumerable language?

Please explain option A.

target2017 asked Nov 19, 2016 • closed Nov 19, 2016 by Kapil

target2017

402 views

See all

2 2 Comments

thor

commented Nov 19, 2016

D is correct answer.

0 votes

Arjun

commented Nov 19, 2016

https://gateoverflow.in/7427/which-following-languages-recursively-enumerable-language

0 votes

Please log in or register to add a comment.

0 Answers

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

worst_engineer asked Jan 10, 2016

904 views

Which of the following language is decidable
Consider the following languages L1 = {< M, q > | M is a turing machine that visits state q on some input within 10 steps} L2 = {< M > | M is a turing machine, |M| < 100 where |M| is number of states in machine ... not tell whether it will not visit q on some input within 10 steps. But , L2 is trivial property , right ? Please correct me.

Consider the following languagesL1 = {< M, q | M is a turing machine that visits state q on some input within 10 steps}L2 = {< M | M is a turing machine, |M| < 100 wher...

worst_engineer

904 views

worst_engineer asked Jan 10, 2016

Theory of Computation
theory-of-computation

+ –

2 votes

2 answers

iita asked Feb 4, 2017

1,795 views

which of the following is the regular language

iita

1.8k views

iita asked Feb 4, 2017

1 votes

3 answers

sh!va asked Jul 9, 2016

657 views

Which of the following is a valid word of the language?
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ? 10110010101 1010101010 000101010000 001010001010

Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ?101100101011010101010000101010000001010001010

sh!va

657 views

sh!va asked Jul 9, 2016

Theory of Computation
theory-of-computation

+ –

5 votes

1 answer

Shefali asked Sep 11, 2015

1,326 views

Which of the following is not a recursive Language? Please explain the reason for each
Which of the following is not a recursive language? a. Regular language b. {$\langle M,w \rangle$ | $M$ is a DFA that accepts $w$} c. {$\langle M \rangle$ | $M$ is a TM and there exists an input which halts within $100$ steps} d. {$\langle M \rangle$ | $M$ is a TM and $L(M)$ is regular }

Which of the following is not a recursive language?a. Regular languageb. {$\langle M,w \rangle$ | $M$ is a DFA that accepts $w$}c. {$\langle M \rangle$ | $M$ is a TM and ...

Shefali

1.3k views

Shefali asked Sep 11, 2015

Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability

+ –

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

2 2 Comments reply

Please log in or register to add a comment.

0 Answers

Related questions

2 2 Comments