64 662
Assignments Done
99,2%
Successfully Done
In September 2018

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
Expert's answer

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

Assignment Expert
31.01.14, 19:16

Dear 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 Roy
30.01.14, 07:12

Thank you.

Leave a comment

Ask Your question

Submit
Privacy policy Terms and Conditions