Which ONE of the following languages is accepted by a deterministic pushdown automaton?
Let $G_1, G_2$ be Context Free Grammars (CFGs) and $R$ be a regular expression. For a grammar $G$, let $L(G)$ denote the language generated by $G$. Which ONE among the following questions is decidable?
Consider the two lists List-I and List-II given below:
| List - I | List - II | ||
|---|---|---|---|
| (i) | Context free languages | (a) | Closed under union |
| (ii) | Recursive languages | (b) | Not closed under complementation |
| (iii) | Regular languages | (c) | Closed under intersection |
For matching of items in List-I with those in List-II, which of the following option(s) is/ are CORRECT?
Let $\Sigma=\{a, b, c\}$. For $x \in \Sigma^{\star}$, and $\alpha \in \Sigma$, let $\#_\alpha(x)$ denote the number of occurrences of a in $x$. Which one or more of the following option(s) define(s) regular language(s)?
GATE CSE Papers
All year-wise previous year question papers