2.10. Suppose L is a language generated by a regular grammar, and consider the f

Question

2.10. Suppose L is a language generated by a regular grammar, and consider the following statements: (i) L is a regular language. (i) L is a context-free language. (iii) There is a Turing machine that accepts L Which of the following is correct? (a) Only statementi) isre (b) Only statement (ii) is true (c) Only statement (ii is true. (d) Only statements (i) (e) Only statements (i) and (iii) are true (f) Only statements andi) are true. (g) All 3 statements are true. (h) None of the 3 statements is true nd) are true.

Explanation / Answer

Solution: -

ans) d) only statement (i) and (ii) are true.

First of all the language is called context-free when generated by grammar (G) such that

L = L(G)

where the start symbol represents start state, terminal symbol is used for 'sigma' and variable symbol used for states.

Since if L is regular, then L will be context-free.

here, L = L(A)

From the DFA A, a context-free grammar is generated by the context free grammar G

Hence, L(A) = L(G)

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.