
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
![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}](https://content.bartleby.com/qna-images/question/544cbbd4-2d92-416e-a882-a37a5fd383b8/5d2b5b26-2761-480c-8e25-f563c431ed86/yotmpk_thumbnail.png)
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 nowThis is a popular solution!
Step by stepSolved in 4 steps with 2 images

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.Similar questions
- Write a function in Scala programming language that takes a string parameter and returns whether the string starts with "Sc" or not. Test the function for the sample strings "Scala", "Programming", "Science".arrow_forwardHaskellarrow_forwardWrite the following function in Lisp: a function that takes one parameter that you can assume to be a symbol named after a day of the week (no need to check it), such as 'monday, and returns the symbol for the next day. For example, (next-day 'tuesday) should return the symbol 'wednesday. Implement this function with a complex conditional.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

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