The number of states in the minimum sized DFA that accepts the language defined by the regular expression [G16S2Q26]

Explanation

Language L1 is defined by the grammar: [G16S2Q27]

Explanation

Consider the following types of languages: L1 : Regular, L2 : Context-free, L3 : Recursive, L4 : Recursively enumerable. Which of the following is/are TRUE? [G16S2Q28]

Explanation

Consider the following two statements: [G16S2Q52]

Explanation

Consider the following languages: [G16S2Q53]

Explanation

Consider the following languages [G16S2Q54]

Explanation

Which one of the following grammars is free from left recursion? [G16S2Q55]

Explanation

A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, [G16S2Q56]

Explanation

Which of the following languages is generated by the given grammar? [G16S1Q26]

Explanation

Which of the following decision problems are undecidable? [G16S1Q27]

Explanation

Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive 1s? [G16S1Q28]

Explanation

Consider the following context-free grammars: [G16S1Q52]

Explanation

Consider the transition diagram of a PDA given below with input alphabet Σ = {a,b} and stack alphabet Γ = {X,Z}. Z is the initial stack symbol. Let L denote the language accepted by the PDA. [G16S1Q53]

Explanation

Let X be a recursive language and Y be a recursively enumerable but not recursive language. Let W and Z be two languages such that Y reduces to W, and Z reduces to X (reduction means the standard many-one reduction). Which one of the following statements is TRUE? [G16S1Q54]

Explanation

Consider the following Syntax Directed Translation Scheme (SDTS), with non-terminals {S, A} and terminals {a, b}. [G16S1Q56]

Explanation

Let L1, L2 be any two context-free languages and R be any regular language. Then which of the following is/are CORRECT? [G17S2Q4]

Explanation

Identity the language generated by the following grammar, where S is the start variable. [G17S2Q16]

Explanation

The minimum possible number of states of a deterministic finite automaton that accepts the regular langauge L [G17S2Q25]

Explanation

Consider the following expression grammar G: [G17S2Q32]

Explanation

Let delta denote the transition function and delta cap denote the extended transition function of the [G17S2Q39]

Explanation