If the strings of a language L can be effectively enumerated in lexicographic…

PYQ GATE 2003

If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true ?

  1. A.

    L is necessarily finite

  2. B.

    L is regular but not necessarily finite

  3. C.

    L is context free but not necessarily regular

  4. D.

    L is recursive but not necessarily context free

Attempted by 115 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…