Question
Download Solution PDFMinimum 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)
Answer (Detailed Solution Below)
Option 4 : can’t be represented
Free Tests
View all Free tests >
Bihar STET Paper 1 Mathematics Full Test 1
14 K Users
150 Questions
150 Marks
150 Mins
Detailed Solution
Download Solution PDFThe 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.
India’s #1 Learning Platform
Start Complete Exam Preparation
Daily Live MasterClasses
Practice Question Bank
Mock Tests & Quizzes
Trusted by 7.2 Crore+ Students