Answer to Question #38619 in Math for Sujata Roy

Question

An arbitrary turing machine M will be given to you and we define a language L as follows
L=(0+00)* if M accepts at least one string
L=(0+00+000)* if M accepts at least two strings
L=(0+00+000+0000)* if M accepts at least three strings
———
———
L=(0+00+000+—+0^n) *if M accepts at least n-1 strings
Choose the correct statement.
a) We cannot say anything about L as the question of whether a turing machine accepts a string is undecidable
b) L is context-sensitive but not regular
c) L is context-free but not regular
d) L is not a finite set