1 1 vote Match the LIST-I with LIST-IILIST-IGrammarLIST-IIAll productions are the formA.Regular GrammarI.$\mathrm{A} \rightarrow \mathrm{aX}$, where $\mathrm{a} \in \mathrm{T}$ and $\mathrm{X} \in \mathrm{V}^{*}$B.Unrestricted GrammarII.$\mathrm{A} \rightarrow \mathrm{xB}, \mathrm{~A} \rightarrow \mathrm{x} \text { or } \mathrm{A} \rightarrow \mathrm{Bx}, \mathrm{~A} \rightarrow \mathrm{x} \text { where } \mathrm{A}, \mathrm{~B} \in \mathrm{~V} \text { and } \mathrm{x} \in \\ \mathrm{~T}^{*}$C.Chomsky Normal FormIII.$\mathrm{x} \rightarrow \mathrm{y}$, where $\mathrm{x} \in(\mathrm{VUT})^{+}$and $\mathrm{y} \in(\mathrm{VUT})^{*}$D.Greibach Normal FormIV.$\mathrm{A} \rightarrow \mathrm{BC}$ or $\mathrm{A} \rightarrow \mathrm{a}$, where $\mathrm{A}, \mathrm{B}, \mathrm{C}$ are in V and a is in T .Choose the correct answer from the options given below:$\text{A-II, B-III, C-I, D-IV}$$\text{A-I, B-III, C-II, D-IV}$$\text{A-II, B-III, C-IV, D-I}$$\text{A-II, B-IV, C-I, D-III}$ Theory of Computation ugcnetcse-dec2025 theory-of-computation grammar regular-grammar context-free-grammar + – Shubham Sharma 2 84 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
