GATE CS 2024 (Afternoon) — Question 62

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)NAT2 marksMedium

Let \( L_1 \) be the language represented by the regular expression \( b^* ab^* (ab^* ab^*)^* \) and \( L_2 = \{w \in (a + b)^* \mid |w| \le 4\} \), where \( |w| \) denotes the length of string \( w \). The number of strings in \( L_2 \) which are also in \( L_1 \) is ________.
Practise the full 2024-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group