Let be the language represented by the regular expression and , where denotes the length of string . The number of strings in which are also in is ________.
GATE CS 2024 (Afternoon) — Question 62
Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)NAT2 marksMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Regular Expressions & Finite Automata (DFA/NFA Min)
- GATE CS 2026 (Forenoon) · Q26Let M be a non-deterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be the numb…
- GATE CS 2026 (Afternoon) · Q47Consider the following two finite automata D 1 and D 2 . Which of the following statements is/are true?
- GATE CS 2025 (Forenoon) · Q28A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FA…
- GATE CS 2025 (Forenoon) · Q50Consider the following deterministic finite automaton (DFA) defined over the alphabet, = \ a, b\ . Identify which of the following language…
- GATE CS 2025 (Afternoon) · Q60Let = \ 1, 2, 3, 4\ . For x , let prod (x) be the product of symbols in x modulo 7. We take prod ( ) = 1 , where is the null string. For ex…
- GATE CS 2024 (Forenoon) · Q50Consider the 5-state DFA M accepting the language L(M) (0 + 1) shown below. For any string w (0 + 1) let n 0(w) be the number of 0's in w a…

