1 votes 1 votes L(M) has at least 10 strings L(M) has at least 10 strings these two languages i have taken from this link http://gatecse.in/rices-theorem/ it says they are not recursive ..but are they R.E?? Theory of Computation theory-of-computation recursive-and-recursively-enumerable-languages + – Akriti sood asked Dec 16, 2016 • retagged Jul 4, 2017 by Arjun Akriti sood 183 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.