Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More
English
Hindi

Question

Download Solution PDF

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)
Download PDF Attempt Online
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 Tests
View all Free tests >
Free
Bihar STET Paper 1 Mathematics Full Test 1
13.7 K Users
150 Questions 150 Marks 150 Mins
Start Now

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. F4 Savita Teaching 15-2-24 D2

Download Solution PDF
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.

‹‹ Previous Ques
Next Ques ››

More Finite Automata Questions

Q1.Which of the following represented the minimum state DFA for the above specified passage?
Q2.For the above specified passage, which of the following represent the grammar for the language accepted the machine?
Q3.For the above mentioned passage which of the following is correct?
Q4.For the above specified passage, which of the following represents the regular expression?
Q5.For the above specified passage, which of the following is DFA for the language represented/accepeted by machine?
Q6.Minimum Number of states require to accept string ends with 101.
Q7.The sum of minimum and maximum number of final states for a Deterministic Finite Automata (DFA) having ‘P’ state is equal to :
Q8.Consider the following finite automata F1 that accepts a language L Let F2 be a finite automata which is obtained by reversal of F1. Then which of the following is correct? 
Q9.In the ε-NFA, M = ({q0, q1, q2, q3}, {a}, δ, q0, {q3}) where 'δ' is given in the transition table below, what is the minimum length of string to reach to the final state?   ε a q0 {q1} {} q1 {q2} {} q2 {} {q2, q3} q3 {} {}
Q10.Which of the following statement(s) is/are TRUE? (i) For every NFA with an arbitrary number of final states, there is an equivalent NFA with only one final state. (ii) A language that is accepted by a DFA will also be accepted by some NFA.

More Regular Languages and Finite Automata Questions

Q1.Consider the finite automata given below : The language b accepted by this automata is given by the regular expression :
Q2.Which of the following represented the minimum state DFA for the above specified passage?
Q3.For the above specified passage, which of the following represent the grammar for the language accepted the machine?
Q4.For the above mentioned passage which of the following is correct?
Q5.For the above specified passage, which of the following represents the regular expression?
Q6.For the above specified passage, which of the following is DFA for the language represented/accepeted by machine?
Q7.Minimum Number of states require to accept string ends with 101.
Q8.The Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1. 
Q9.Let L={ab, aa, baa}. Which of the following strings are not in L*. 
Suggested Test Series
View All >
Bihar STET Paper 1 (माध्यमिक) Mock Test 2024
321 Total Tests with 5 Free Tests
Start Free Test
Bihar B.Ed CET Mock Test Series 2025
200 Total Tests with   4 Free Tests
Start Free Test

More Theory of Computation Questions

Q1.Consider the finite automata given below : The language b accepted by this automata is given by the regular expression :
Q2.Let L = L1 ∩ L2 where L1 and L2 are language defined below : L1 = {ambmc an bn m, n ≥ 0} L2 = {aibj ck | i, j, k ≥ 0} Then L is : 
Q3.If T1 and T2 are two Turing machines. The composite can be represented using the expression :
Q4.__________ is the most general phase structured grammar.
Q5.Consider the grammar with nonterminals N = {S, C, S1} terminals T = {a, b, i, t, e} With S as the start symbol , and the following set of rules : S → i Ct SS1|a S1 → es | ∈ C → b The grammar is not LL(1) because : 
Q6.Which of the following problems is undecidable ? 
Q7.Which of the following represented the minimum state DFA for the above specified passage?
Q8.For the above specified passage, which of the following represent the grammar for the language accepted the machine?
Q9.For the above mentioned passage which of the following is correct?
Q10.For the above specified passage, which of the following represents the regular expression?
Important Exams
Super Coaching
Exams
Test Series
Previous Year Papers
Objective Questions
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti gold download teen patti rules teen patti joy official