retagged by
1,031 views
0 votes
0 votes

If any string of a language $L$ can be effectively enumerated by an enumerator in a lexicographic order then language $L$ is _______.

  1. Regular
  2. Context free but not necessarily regular
  3. Recursive but not necessarily context free
  4. Recursively enumerable but not necessarily recursive
retagged by

2 Answers

0 votes
0 votes
if the string of a language L is enumerated then definitely it is countable, so there exists a turning machine which accepts it and halts.so it is Recursive but it cannot be Recursively enumerable because for this language the turning machine doesn't get halt.

Answer:opt c
Answer:

Related questions

0 votes
0 votes
4 answers
1
0 votes
0 votes
3 answers
2
admin asked Mar 30, 2020
1,437 views
The collection of Turing recognizable languages are closed under:UnionIntersectionComplementConcatenationStar Closure(i) OnlyBoth (i),(iv)(i),(ii),(iv)and(v)All of the op...
0 votes
0 votes
6 answers
4
admin asked Mar 30, 2020
2,409 views
According to the given language, which among the following expressions does it correspond to ?Language $L=\{x\in\{0,1\}\mid x\text{ is of length 4 or less}\}$.$(0+1+0+1+0...