List of top Theory of Computation Questions on Regular expressions and finite automata asked in AP PGECET

The minimum number of states in a DFA accepting \( L = \{ w | w \text{ ends with } 01 \} \) over \( \Sigma = \{0, 1\} \) is _______ .
Which of the following is FALSE?
Let \( P \) be a regular language and \( Q \) be a context free language such that \( Q \) is a subset of \( P \). Then which of the following is ALWAYS regular?
The maximum number of transitions which can be performed over a state in a DFA? \( \Sigma = \{a, b, c\} \)
Which of the following is a regular language?
The minimum number of nodes in a DFA that recognizes strings over \( \{a, b\} \) with length mod 3 = 0 are _______ .