GATE CS 2024 (Forenoon) — Question 61

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

Consider the following two regular expressions over the alphabet \( \{0, 1\} \): \( r = 0^* + 1^* \) \( s = 01^* + 10^* \) The total number of strings of length less than or equal to 5, which are neither in \( r \) nor is \( s \), is ________.
Practise the full 2024-FN 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