The number of states in the minimum sized DFA that accepts the language defined by the regular expression 

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

is ______.

This question was previously asked in
GATE CS 2016 Official Paper: Shift 2
View all GATE CS Papers >

Answer (Detailed Solution Below) 2

Free
GATE CS Full Mock Test
5.3 K Users
65 Questions 100 Marks 180 Mins

Detailed Solution

Download Solution PDF

Given regular expression: (0 + 1)*(0 + 1)(0 + 1)*

In this, there is atleast one appearance of (0 + 1).

It generates strings of type {0, 1, 00, 01, 10, 11, 000, 001, 011, ……. }

DFA for the given expression is:

F1 R.S 24.12.19 Pallavi D 2

Number of states in minimum sized DFA for this regular expression = 2

Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

Hot Links: teen patti baaz all teen patti game teen patti win teen patti master king teen patti jodi