UGC NET CS 2007 JunePaper2
October 13, 2023UGC NET CS 2007 JunePaper2
October 13, 2023UGC NET CS 2007 JunePaper2
Question 5

L = { a^{n} b^{n} n ≥ 1 }


L = { a^{n} b^{m} c^{n }d^{m}n, m ≥ 1 }


L = { a^{n} b^{m}n, m ≥ 1 }


L = { a^{n} b^{m} c^{n}n, m ≥ 1 }

Language generated in Option (B) requires a memory element and a readwrite head which can move in both directions to count equal numbers of a’s and c’s , and b’s and d’s. And since regular languages are accepted by finite automata which do not have a memory element and a readwrite head which can move in both directions. Hence Option (A) language is not Regular.
Language generated in Option (C) is regular because the number of a’s and b’s does not necessarily need to be the same which means no memory element is required. Hence it is a regular language.
Language generated in Option (D) requires a memory element to count an equal number of c’s after a. And since regular languages are accepted by finite automata which do not have a memory element. Hence Option (A) language is not Regular. The language generated here is context free language which can be accepted by pushdown automata.
Language generated in Option (B) requires a memory element and a readwrite head which can move in both directions to count equal numbers of a’s and c’s , and b’s and d’s. And since regular languages are accepted by finite automata which do not have a memory element and a readwrite head which can move in both directions. Hence Option (A) language is not Regular.
Language generated in Option (C) is regular because the number of a’s and b’s does not necessarily need to be the same which means no memory element is required. Hence it is a regular language.
Language generated in Option (D) requires a memory element to count an equal number of c’s after a. And since regular languages are accepted by finite automata which do not have a memory element. Hence Option (A) language is not Regular. The language generated here is context free language which can be accepted by pushdown automata.