Consider the following C function definition.
int f(int x, int y) {
for (int i=0; i<y; i++) {
x=x+x+y;
}
return x;
}
Which of the following statements is/are TRUE about the above function?
Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular. Which of the following statements is/are always TRUE?
Consider the 5-state DFA $M$ accepting the language $L(M) \subseteq (0+1)^*$ shown below. For any string $w \in (0+1)^*$ let $n_0(w)$ be the number of 0's in $w$ and $n_1(w)$ be the number of 1's in $w$.
![GATE CSE 2024 Set 1 Theory of Computation - Finite Automata and Regular Language Question 5 English](https://app-content.cdn.examgoal.net/fly/@width/image/6y3zli1lwudgsa3/5967e0f4-529b-4f25-a913-7a26e7bb4b18/b7094fb0-1f20-11ef-b5e1-abf5eb713f23/file-6y3zli1lwudgsa4.png?format=png)
Which of the following statements is/are FALSE?
Let G = (V, Σ, S, P) be a context-free grammar in Chomsky Normal Form with Σ = { a, b, c } and V containing 10 variable symbols including the start symbol S. The string w = a30b30c30 is derivable from S. The number of steps (application of rules) in the derivation S ⟹ w is _______