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 in App
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
150 Qs. 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. 

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 ››
Exams Tests Super Practice

More Finite Automata Questions

Q1.Minimum Number of states require to accept string ends with 101.
Q2.The sum of minimum and maximum number of final states for a Deterministic Finite Automata (DFA) having ‘P’ state is equal to :
Q3.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? 
Q4.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 {} {}
Q5.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.
Q6.A deterministic finite automaton (DFA) D with alphabet ∑ = {a,b} is given below. Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?
Q7.Definition of a language L with alphabet {a} is given as following. L= {ank | k > 0, and n is a positive integer constant} What is the minimum number of states needed in a DFA to recognize L?
Q8.The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?
Q9.What is the complement of the language accepted by the NFA shown below? Assume ∑ = {a} and ϵ is the empty string
Q10.The following Finite Automaton recognizes which of the given languages?

More Regular Languages and Finite Automata Questions

Q1.Minimum Number of states require to accept string ends with 101.
Q2.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. 
Q3.Let L={ab, aa, baa}. Which of the following strings are not in L*. 
Q4.The sum of minimum and maximum number of final states for a Deterministic Finite Automata (DFA) having ‘P’ state is equal to :
Q5.Which of the statement is/are CORRECT? (A) Moore and Mealy machines are finite state machines with output capabilities. (B) Any given Moore machine has an equivalent Mealy machine. (C) Any given Mealy machine has an equivalent Moore machine. (D) Moore machine is not a finite state machine. Choose the correct answer from the options given below:
Q6.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? 
Q7.Consider the following language: L= {w ∈ { a, b, c }* : na(ω) + nb(ω) = nc(ω)} L is 
Q8.Which of the following are correct on regular expressions? A. φ + L = L + φ = L B. εL = Lε = L C. φL = Lφ = φ D. φL = Lφ = L Choose the correct answer from the options given below: 
Q9.Which of the following is (are) correct about the regular expression? aa*bb*cc*dd* A. The language for the given expression is: L = {anbncmdm | n ≥ 1, m ≥ 1} U {anbmcmdn | n ≥ 1, m ≥ 1} B. The Context Free Language for the given expression is: S → AB | C A → aAb | ab B → cBd | cd C → aCd | aDd D → bDc | bc C. The language generated by this expression is equal number of 'a's, followed by equal number of 'b's, followed by equal number of 'c's and followed by equal number of 'd's. Choose the correct answer from the options given below:
Q10.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 {} {}
Suggested Test Series
View All >
Bihar STET Paper 1 (माध्यमिक) Mock Test 2024
321 Total Tests with 5 Free Tests
Start Free Test
Bihar STET Paper 2 (उच्च माध्यमिक) Mock Test 2024
508 Total Tests with   24 Free Tests
Start Free Test

More Theory of Computation Questions

Q1.Minimum Number of states require to accept string ends with 101.
Q2.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. 
Q3.Let A= {a, b} and L = A*. Let x = {anbn, n > 0}. The languages L ∪ X and X are respectively :  
Q4.Let L={ab, aa, baa}. Which of the following strings are not in L*. 
Q5.The sum of minimum and maximum number of final states for a Deterministic Finite Automata (DFA) having ‘P’ state is equal to :
Q6.Which of the statement is/are CORRECT? (A) Moore and Mealy machines are finite state machines with output capabilities. (B) Any given Moore machine has an equivalent Mealy machine. (C) Any given Mealy machine has an equivalent Moore machine. (D) Moore machine is not a finite state machine. Choose the correct answer from the options given below:
Q7.A. The set of turning machine codes for TM's that accept all inputs that are palindromes (possible along with some other inputs) is decidable B. The language of codes for TM's M that when started with blank tape, eventually write a 1 somewhere on the tape is undecidable C. The language accepted by a TM M is L (M) is always recursive D. Post's correspondence problem is undecidable Choose the correct answer from the options given below: 
Q8.Consider following statements: A. A context free language is generated by LR(o) grammar if and only if it is accepted by a deterministic pushdown automata and has prefix property B. If M1 is the single tape TM simulating multilape TM M, then time taken by M1 to simulate n moves is (n3) C. Push down automata behaves like a Turning machine when it has one auxiliary memory. D. L= {anbncn : n ≥ 1} is not context free but context sensitive. Choose the correct answer from the options given below:
Q9.The maximum yield length of the following CNF CFG is S → AB A → CD B → e C → a D → b
Q10.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? 
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
support@testbook.com
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
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti real cash apk teen patti master update teen patti lucky