Minimum Number of states require to accept string ends with 101.

This question was previously asked in
Bihar STET PGT (Computer Science) Official Paper-II (Held On: 12 Sept, 2023 Shift 1)
View all Bihar STET Papers >
  1. 3
  2. 2
  3. 1
  4. can’t be represented

Answer (Detailed Solution Below)

Option 4 : can’t be represented
Free
Bihar STET Paper 1 Mathematics Full Test 1
150 Qs. 150 Marks 150 Mins

Detailed Solution

Download Solution PDF

The correct answer is can’t be represented

Key PointsTo design a deterministic finite automaton (DFA) that accepts strings ending with "101," we can use 4 states. 

Latest Bihar STET Updates

Last updated on Jan 29, 2025

-> The Bihar STET 2025 Notification will be released soon.

->  The written exam will consist of  Paper-I and Paper-II  of 150 marks each. 

-> The candidates should go through the Bihar STET selection process to have an idea of the selection procedure in detail.

-> For revision and practice for the exam, solve Bihar STET Previous Year Papers.

More Finite Automata Questions

More Regular Languages and Finite Automata Questions

Hot Links: teen patti real cash apk teen patti master update teen patti lucky