GATE 2024 theory of computation Rank Booster Quiz 11

Consider the following statements regarding alphabet and language inequalities.

Which of the above statements are always true?

The number of substrings (both trivial and nontrivial included) for a string containing n distinct characters is

Consider a language L over alphabet {a, b}. If we construct DFA for L then trap state needs to be introduce in case of

Number of final states in the language L where 3^rd symbol from RHS is ‘a’ if alphabet is {a,b}.

How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

Consider the string w = “ PICHAI”. Which of the following is not a valid suffix of

Consider the following finite automata with Σ = {a, b}:

What will be the number of states in the minimized DFA constructed for the language accepted by given automata?