If L be a language recognizable by a finite automaton, then language front
{L} = { w such that w is prefix of v where v ∈ L }, is a
| A. | regular language |
| B. | context-free language |
| C. | context-sensitive language |
| D. | recursive enumeration language |
Answer : A Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
