1. Write regular expression for the following languages, alphabet {0,1} a. The set of strings that do not end with 11 b. The set of strings that do not contain substring 01 c. The set of strings having 0 at every 3rd position. d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set of all strings that are at least of length 4 and contains an even number of l's.
1. Write regular expression for the following languages, alphabet {0,1} a. The set of strings that do not end with 11 b. The set of strings that do not contain substring 01 c. The set of strings having 0 at every 3rd position. d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set of all strings that are at least of length 4 and contains an even number of l's.
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
Related questions
Question
Answer of JPG?
![1. Write regular expression for the following languages, alphabet {0,1}
a. The set of strings that do not end with 11
b. The set of strings that do not contain substring 01
c. The set of strings having 0 at every 3rd position.
d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set of
all strings that are at least of length 4 and contains an even number of 1's.
2. Draw the DFA for the following languages
a. L = {w]w contains substring "aba" and has b in the second last position} b. L =
{w[ every 3rd symbol in w is 0} e.g. 110100, 000110001. But 101 won't be
accepted since the 3rd symbol is 1.
c. Set of all strings that are at least of length 4 and contain an even number of 1's
d. L= {w| The 3rd last symbol in w is 0}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc74878c8-4d14-4576-a040-1eab0b792053%2F134f4b45-7c42-4868-b294-eb6a779f6551%2F3a6rbuv_processed.png&w=3840&q=75)
Transcribed Image Text:1. Write regular expression for the following languages, alphabet {0,1}
a. The set of strings that do not end with 11
b. The set of strings that do not contain substring 01
c. The set of strings having 0 at every 3rd position.
d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set of
all strings that are at least of length 4 and contains an even number of 1's.
2. Draw the DFA for the following languages
a. L = {w]w contains substring "aba" and has b in the second last position} b. L =
{w[ every 3rd symbol in w is 0} e.g. 110100, 000110001. But 101 won't be
accepted since the 3rd symbol is 1.
c. Set of all strings that are at least of length 4 and contain an even number of 1's
d. L= {w| The 3rd last symbol in w is 0}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education