# Answer to Question #38609 in Other Math for Sujata Roy

Question #38609

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

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

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

Assignment Expert31.01.14, 19:16Dear Sujata Roy.

You're welcome. We are glad to be helpful. If you really liked our service please press like-button beside answer field. Thank you!

Sujata Roy30.01.14, 07:12Thank you.

## Leave a comment