If the strings of a language L can be effectively enumerated in lexicographic…
GATE · 2003 · CS
If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true ?
- A.
L is necessarily finite
- B.
L is regular but not necessarily finite
- C.
L is context free but not necessarily regular
- D.
L is recursive but not necessarily context free
Attempted by 75 students.
Sign up free to check your answer
Sign up freeLoading lesson…