Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

For each of the following statements. state whether it is True or False. Prove your answer: a. L1 , L2(L1= L2)iff L1*=L2*). b. (u*)n(- (*))

For each of the following statements. state whether it is True or False. Prove your answer: a. L1 , L2(L1= L2)iff L1*=L2*). b. (u*)n(- (*)) = (where is the complement of ). c. Every infinite language is the complement of a finite language. d. L ((LR)R = L). e. L1, L2((L1L2)*= L1*L2*). f. L1, L2(( ((L1*L2*L1*)*= (L2UL1)*). g . L1, L2(( ( ( L 1 U L 2 ) * = L 1 * U L 2 * ) . h. L1, L2((,L3((L1UL2)L3= (L1L3)U(LzLJ)). i. L1, L2, L3 ((L,L2) U L3 = (L1U L3) (L2 U L3)) j. L ((L+)* = L*). k. L (L* = {e}). I. VL(UL+= L*). m. VL1, L2 ((L1 U L2)* = (L2 U L1)*). the * indicates the set of possible strings. The set of all possible strings over an alphabet is indicated by * L consists of all strings that can be formed by taking some strings in {a,b}* Where a, b are elements of L and some psossible strings that can be formed include, a, aa, bb, aaabb, etc.

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

SQL Instant Reference

Authors: Gruber, Martin Gruber

2nd Edition

0782125395, 9780782125399

More Books

Students also viewed these Databases questions