Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Find the regular expression for the language accepted by the automata given below.

F5 Vinanti Engineering 20.01.23 D15

  1. (aa* (a + b) ab)*
  2. (a + b) ab (ab + bb + aa* (a + b) ab)*
  3. a* ab (ab + bb + aa* (a + b) ab)*
  4. a* (a + b) ab (ab + bb + aa* (a + b) ab)*

Answer (Detailed Solution Below)

Option 2 : (a + b) ab (ab + bb + aa* (a + b) ab)*

Detailed Solution

Download Solution PDF

F5 Vinanti Engineering 20.01.23 D16

F5 Vinanti Engineering 20.01.23 D17

F5 Vinanti Engineering 20.01.23 D18

F5 Vinanti Engineering 20.01.23 D19

F5 Vinanti Engineering 20.01.23 D20

Note: This question is dropped by NTA.

 

Download Solution PDF

More Regular Languages 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 is TRUE about the Pumping Lemma for regular language?
Q3.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. 
Q4.Let L={ab, aa, baa}. Which of the following strings are not in L*. 
Q5.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: 
Q6.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:
Q7.In Pumping Lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of 'y' if you consider the string as 'xyz'.
Q8.Consider the language L = {anbm ∶ n ≥ 4, m ≤ 3} Which of the following regular expression represents language L?
Q9.Consider the production rules of grammer G: S → AbB A → aAb ∣ λ B → bB ∣ λ Which of the following language L is generated by grammer G?
Q10.Find the regular expression for the language accepted by the automata given below.

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.Which of the following is TRUE about the Pumping Lemma for regular language?
Q8.Minimum Number of states require to accept string ends with 101.
Q9.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. 
Q10.Let L={ab, aa, baa}. Which of the following strings are not in L*. 

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?
Exams
Test Series
SuperCoaching
Previous Year Papers
Latest Updates
MCQ Questions
Testbook Products & Resources for Students
Testbook USA
Books
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 app real cash teen patti teen patti noble teen patti stars