The maximum number of transitions which can be performed over a state in a DFA? \( \Sigma = \{a, b, c\} \)
Show Hint
- 8
- 2
- 3
- 7
The Correct Option is C
Solution and Explanation
Top Questions on Regular expressions and finite automata
Match LIST-I with LIST-II \[\begin{array}{|c|c|c|}\hline \text{ } & \text{LIST-I} & \text{LIST-II} \\ \hline \text{A.} & \text{A Language L can be accepted by a Finite Automata, if and only if, the set of equivalence classes of $L$ is finite.} & \text{III. Myhill-Nerode Theorem} \\ \hline \text{B.} & \text{For every finite automaton M = $(Q, \Sigma, q_0, A, \delta)$, the language L(M) is regular.} & \text{II. Regular Expression Equivalence} \\ \hline \text{C.} & \text{Let, X and Y be two regular expressions over $\Sigma$. If X does not contain null, then the equation $R = Y + RX$ in R, has a unique solution (i.e. one and only one solution) given by $R = YX^*$.} & \text{I. Arden's Theorem} \\ \hline \text{D.} & \text{The regular expressions X and Y are equivalent if the corresponding finite automata are equivalent.} & \text{IV. Kleen's Theorem} \\ \hline \end{array}\]
\[\text{Matching List-I with List-II}\]
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Data Science
- Regular expressions and finite automata
- The minimum number of states in a DFA accepting \( L = \{ w | w \text{ ends with } 01 \} \) over \( \Sigma = \{0, 1\} \) is _______ .
- AP PGECET - 2025
- Theory of Computation
- Regular expressions and finite automata
- Which of the following is FALSE?
- AP PGECET - 2025
- Theory of Computation
- Regular expressions and finite automata
- 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?
- AP PGECET - 2025
- Theory of Computation
- Regular expressions and finite automata
- Which of the following is a regular language?
- AP PGECET - 2025
- Theory of Computation
- Regular expressions and finite automata
Questions Asked in AP PGECET exam
- Consider the system of equations:
\[ x + 2y - z = 3 \\ 2x + 4y - 2z = 7 \\ 3x + 6y - 3z = 9 \]
Which of the following statements is true about the system?
- AP PGECET - 2025
- Linear Algebra
- The multiple access method used in Global Positioning Systems is ________.
- AP PGECET - 2025
- Digital Electronics and Logic Gates
- National Remote Sensing Day is celebrated on ________ every year.
- AP PGECET - 2025
- Remote Sensor
- SDI stands for
- AP PGECET - 2025
- Remote Sensor
- Suppose \( R_1 \) and \( R_2 \) are reflexive relations on a set \( A \). Which of the following statements is correct?
- AP PGECET - 2025
- Set Theory