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

Asked Nov 21 '15 at 16:45

Active Nov 21 '15 at 16:45

Viewed 303 times

(A) L is Regular (b) L is context free but not necessarily Regular (c) L is recursive but not necessarily Regular (d) L is recursively enumerable but not necessarily Recursive

I could only conclude that L is recursively enumerable from above statement but then why is it recursive ?

asked Nov 21 '15 at 16:45

radhika

2

If we enumerate until we are "past" the word $w$, we know whether or not $w$ is in $L$. – André Nicolas Nov 21 '15 at 18:04
I am unable to get in this that since all the strings are in lexicographical order so obviously all the words will be enumerated so then why will there exist any word which won't belong to the set – radhika Nov 23 '15 at 12:41

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

0 Answers0