Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by jha_gaurav98
4
answers
1
GATE CSE 2003 | Question: 15
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true? $L$ is necessarily finite $L$ is regular but not necessarily finite $L$ is context free but not necessarily regular $L$ is recursive but not necessarily context-free
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true?$L$ is necessarily fin...
15.7k
views
commented
Jan 9, 2019
Theory of Computation
theory-of-computation
gatecse-2003
normal
recursive-and-recursively-enumerable-languages
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
