GATE CS 2016 Set 2 — Question 26

NAT+1 / -0EasyDFAFinite Automata & Regular LanguagesTheory of ComputationRegular Expressions

Theory of Computation → Finite Automata & Regular Languages → DFA

Last updated 5 September 2026

Question

(0+1)^*(0+1)(0+1)^*

R = (0+1)^*(0+1)(0+1)^*

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

R = (0+1)^*(0+1)(0+1)^*

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.