293 views

1 Answer

0 votes
0 votes
There would be some TM who would have cardinality 'n' and There would be some TM which don't have cardinality 'n' so It's non-trivial for sure so we can first tell that its undecidable.

Now if it's semidecidable ? then Go to Rice's  Theorem . it would tell you that containing Exactly 'n' strings is a non-monotone property for RE sets so yes it not even Semidecidable.

Related questions

0 votes
0 votes
0 answers
1
Shamim Ahmed asked Jan 2, 2019
440 views
CFG G=(N,Σ,P,S) and a string x∈Σ∗, does x∈L(G)} ?Is it Decidable?