A language L is accepted by a finite automaton if and only if it is
| A. | context - free |
| B. | context-sensitive |
| C. | recursive |
| D. | Right-linear |
Answer : D Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
