$L = \{ \langle M \rangle \mid M \text{ accepts two strings of different lengths} \}$.
What is complement of this language?
my attempt:
the complement is: $M$ accepts no two strings of same length and this can be done by dovetailing different inputs on M but we can never say IT CANNOT ACCEPT TWO STRING OF SAME LENGTH and hence its NOT RECURSIVELY ENUMERABLE?