The Gateway to Computer Science Excellence

0 votes

1.{<M>| M is a TM accepts any string starting with 1}

2.{<M>| M is TM accept exactly 20 strings}

Please guide

I don’t know how to apply rice theorem.

for 1. Is Tyes = { string starting with 1} Tno = { all strings – strings starting with 1}

- what is Tyes and Tno here? I only conclude by intution that when we provide strings as input some got into loop and some got accepts .

+1

@Learner_jai the option 2 is decidable as finite number of strings can be accepted by DFA

for option 1. its also decidable since all the strings starting with 1 , can be given by regex 1(0+1)*.

+1

The question is about acceptance of strings by TM. Isn't it a membership problem which is undecidable?

+1

@ Learner_jai (1)Tyes = { string starting with 1} Tno = { all strings – strings starting with 1} .yes these statements are right ,and we can conclude that this is non trivial property so this is undecidable.

(2) $L_{yes}=${accept exactly 20 strings(0,1,11,111....) }

$L_{no}=${0}

so we can clearly see that these two RE set in which first one satisfy the property and second one doesn't ,so we can conclude that this is non trivial property so this is undecidable.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,292 answers

198,224 comments

104,909 users