Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

8. The operation DM(L) is defined as follows: 1. Throw away every even-length string from L. 2. For each odd-length string, remove the middle character.

image text in transcribed

8. The operation DM(L) is defined as follows: 1. Throw away every even-length string from L. 2. For each odd-length string, remove the middle character. For example, if L 1001, 1100, 10101}, then DM(L) 101,10013. That is, even-length string 1100 is deleted, the middle character of 001 is removed to make 01, and the middle character of 10101 is removed to make 1001 It turns out that if L is a regular language, DM(L) may or may not be regular For each of the following languages L, determine what DM(L) is, and tell whether or not it is regular. Ly: the language of regular expression (01)*O L2: the language of regular expression (0+1)*10+1)" L3: the language of regular expression (101)* : the language of regular expression 001 1*. Now, identify the true statement below. a) DML) is regular; it is the language of regular expression (01) (10)* b) c) d) DM(12) is regular; it is the language of regular expression ((0+1) DM(L4) is regular; it is the language of regular expression 0*1*. DM(L) is not regular; it consists of all strings of the form 01n. O 8. The operation DM(L) is defined as follows: 1. Throw away every even-length string from L. 2. For each odd-length string, remove the middle character. For example, if L 1001, 1100, 10101}, then DM(L) 101,10013. That is, even-length string 1100 is deleted, the middle character of 001 is removed to make 01, and the middle character of 10101 is removed to make 1001 It turns out that if L is a regular language, DM(L) may or may not be regular For each of the following languages L, determine what DM(L) is, and tell whether or not it is regular. Ly: the language of regular expression (01)*O L2: the language of regular expression (0+1)*10+1)" L3: the language of regular expression (101)* : the language of regular expression 001 1*. Now, identify the true statement below. a) DML) is regular; it is the language of regular expression (01) (10)* b) c) d) DM(12) is regular; it is the language of regular expression ((0+1) DM(L4) is regular; it is the language of regular expression 0*1*. DM(L) is not regular; it consists of all strings of the form 01n. O

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Joe Celkos Data And Databases Concepts In Practice

Authors: Joe Celko

1st Edition

1558604324, 978-1558604322

More Books

Students also viewed these Databases questions

Question

What are the Five Phases of SDLC? Explain each briefly.

Answered: 1 week ago

Question

How can Change Control Procedures manage Project Creep?

Answered: 1 week ago