The Gateway to Computer Science Excellence
0 votes

has at most 10 strings

We can have Tyes

for ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive).


problem :

It should not b  Tyes Σ∗  and Tno for ϕ
in Theory of Computation by Active (1.9k points) | 70 views

Please log in or register to answer this question.

Related questions

Quick search syntax
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
50,737 questions
57,356 answers
105,252 users