NIELIT 2016 MAR Scientist B - Section C: 27

Question

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

• A. regular language.
• B. context-free language.
• C. context-sensitive language.
• D. recursive enumeration language

Comments

option a is correct

---

Can we say that if the prefix w is epsilon then will  {L} = {v| v belong  to L}.

And since L is regular {L} has to be regular?

Answer 1

Answer related to prefix of a string is always Regular

Answer 2

opt a is correct as the finite automata is accepting it

Answer 3

Obviously it is option a as rl is closed on prefix and suffix also

Answer 4

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.