Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b's where the third symbol fr The regular expression for L is (a+ b) b(a +b)*. II. The language L accepts all the strings of a's and b's where the number of . divisible by 3. The regular expression for L is (b* ab* ab* ab*)*. III. The regular expression R= (a+b)" . The number of states required to const DEA for the reqular expression Ris nt2.

Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b's where the third symbol fr The regular expression for L is (a+ b) b(a +b)*. II. The language L accepts all the strings of a's and b's where the number of . divisible by 3. The regular expression for L is (b* ab* ab* ab*)*. III. The regular expression R= (a+b)" . The number of states required to const DEA for the reqular expression Ris nt2.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%
Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b’s where the third symbol from left end is b. The regular expression for L is (a + b)² b(a+b)*. II. The language L accepts all the strings of a's and b's where the number of a's in a string is divisible by 3. The regular expression for L is (b* ab* ab*ab*)* . III. The regular expression R =(a+b)" . The number of states required to construct the minimal DFA for the regular expression R is n+2. (A) I and II (B) I and III (С) II and III (D) All are correct
Transcribed Image Text:Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b’s where the third symbol from left end is b. The regular expression for L is (a + b)² b(a+b)*. II. The language L accepts all the strings of a's and b's where the number of a's in a string is divisible by 3. The regular expression for L is (b* ab* ab*ab*)* . III. The regular expression R =(a+b)" . The number of states required to construct the minimal DFA for the regular expression R is n+2. (A) I and II (B) I and III (С) II and III (D) All are correct
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Algebraic Expressions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS