Register

madeeasy work book

804 views
2 2 votes
which of the following is decidable?

1)for some input if an arbitrary TM makes 5 moves.

2) whether an arbitary TM halts within 5 steps

3) whether an arbitary TM prints some non blank character

4)the set of codes for TM that never make a left move.

5)an arbitrary TM halts after 100 steps

6)a TM prints a specific letter

7) a turing machine computes the product of two numbers

thanku

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · self doubtNext → · Undecidability
← Previous in category · If a language(L) is ...Next in category → · Undecidability
Position:
Show:

Related questions

0 0 votes
0 0 answers
567
567 views
aaru14 asked Nov 18, 2017
567 views
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=13192646339913379886please someone exaplain ?
2 2 votes
1 answers 1 answer
2.4k
2.4k views
aaru14 asked Nov 13, 2017
2,411 views
madeeasy work book
S >aSa|bSb|a|b|epsilonfor above CFG find the total no of strings generated whose length is less than or equal to 10 [excluding the empty string]?
1 1 vote
0 0 answers
428
428 views
aaru14 asked Nov 13, 2017
428 views
madeeasy work book
S >aSb|SS|epsilonL={w|w belongs {a,b}* and a(v)>=b(v), where v is any prefix of w} (propery balanced parenthesis) plz someone tell me what does it mean am not getting???
2 2 votes
0 0 answers
2.4k
2.4k views
aaru14 asked Nov 13, 2017
2,353 views
madeeasy work book
L={a^n b^n a^n |n=1,2,3.........} is an example of a language that is a)context freeb)not context freec)not context free but whose complement is CFd)context free but whos...