If the strings of a language L can be effectively enumerated in lexicographic order then is the statement L is recursive but not necessarily context free is true?
If the strings of a language can be enumerated in lexicographic order, is it recursive?
formal languages;computability;context free;enumeration