Register

NIELIT 2016 MAR Scientist B - Section C: 27

• retagged by
890 views
4 votes
4 votes

If $L$ be a language recognizable by a finite automaton, then language from $\{L\} = \{w$ such that $w$ is a prefix of $v$ where $v\in L\}$, is a

  1. regular language.
  2. context-free language.
  3. context-sensitive language.
  4. recursive enumeration language
• retagged by
User Avatar

4 Answers

0 votes
0 votes
Option A is correct ,

 Suppose L= {abcd} is regular , then prefix(L)={epsilon,a,ab,abc,abcd} that are finite , therefore prefix(L) is regular.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
4 answers
1
admin asked Mar 31, 2020
799 views
NIELIT 2016 MAR Scientist B - Section C: 28
Which of the following statements is correct? $A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular language Set $B$ of all strings of equal number of $a$'s and $b$'s defines a regular language $L(A^*B^*) \cap B$ gives the set $A$ None of these.
Which of the following statements is correct?$A=\{a^nb^n\mid n= 0,1,2,3\dots \}$ is regular languageSet $B$ of all strings of equal number of $a$'s and $b$'s defines a re...
User Avatar
1 votes
1 votes
2 answers
2
admin asked Mar 31, 2020
1,713 views
NIELIT 2016 MAR Scientist B - Section C: 19
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is in P NP both (A) and (B) None of these
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is inPNPboth (A) and (B)None of these
User Avatar
2 votes
2 votes
2 answers
3
admin asked Mar 31, 2020
2,494 views
NIELIT 2016 MAR Scientist B - Section C: 24
Which of the following regular expressions denotes a language comprising all possible strings over the alphabet $\{a,b\}$? $a^*b^*$ $(a\mid b)^*$ $(ab)^+$ $(a\mid b^*)$
Which of the following regular expressions denotes a language comprising all possible strings over the alphabet $\{a,b\}$?$a^*b^*$$(a\mid b)^*$$(ab)^+$$(a\mid b^*)$
User Avatar
Link Copied!