0 votes 0 votes Show that a language is decidable iff some enumerator enumerates the language in the standard string order. Theory of Computation michael-sipser theory-of-computation decidability proof + – admin asked Oct 15, 2019 edited Oct 15, 2019 by Lakshman Bhaiya admin 124 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.