(1) (a) Let r, 1, and r, be regular expression. Find all the regular ones from the following expression s:2, r'-0. ((r')). r), n -n +½.(b) Given a regular expression 7; = a(ab)* +b°a*, r, = (b + a)* +a*, find L(;) and L(r,),the languages associated with i and r3, respective ly.(c) Find a regular expression r such that L(r) is the same asL = {b"ab",(ba)* : n, m2 0,h2 1}.%3D

a) λ, r*Φ, r1-r2+r3 b) L(r1) = {a(ab)n | n>=0} U {bman | m>0,n>0} L(r2) = {(bnam)k |…

(1) (a) Let r, 1, and r, be regular expression. Find all the regular ones from the following expression: 2, r'-0. ((r*). r), i-, +½. (b) Given a regular expression i = a(ab)* +b°a*, r, = (b + a) * +a*, find L(;) and L(r,), the languages associated with 7i and r2, respective ly. (c) Find a regular expression r such that L(r) is the same as L= {b"ab",(ba)*: n, m2 0,h2 1}.

(1) (a) Let r, 1, and r, be regular expression. Find all the regular ones from the following expression: 2, r'-0. ((r). r), i-, +½. (b) Given a regular expression i = a(ab) +b°a, r, = (b + a) +a, find L(;) and L(r,), the languages associated with 7i and r2, respective ly. (c) Find a regular expression r such that L(r) is the same as L= {b"ab",(ba): n, m2 0,h2 1}.

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

Similar questions

For each of the following languages Ls {a, b}*, show that the elements of the infinite set {a"|n > 0} are pairwise L-distinguishable. (d) L= {a'b'\j is a multiple of i}
3. (a) Let Σ = {a, b}. Find a regular expression corresponding to the language L = {ba} ∗ ∪ {aa, bb}. (b) Let Σ = {0, 1}. Give the language corresponding to the regular expression 10∗ (0 +.
Use the Pumping Lemma to show that the the following language over {a,b,c}* is not CF {wct | t ∈ {a,b}* ∧ w is a substring of t}
Let A be a language such that A ≤m PCP and ETM ≤m A. What can you say about A? Briefly explain your answer.
Make a conjecture whether or not it is regular and prove your assertion. When you prove a language is not regular, use the game with demon. Do not apply Pumping Lemma directly.
Pumping lemma Show that the language l is not context free {L = xxyya+1xb+1|a,b=>1}
Not handwritten Given the language L denoted by r = (a+b)* . (aa*+b) and, ∑ = {a,b} and ∏ = {c,d,x} h(b) = xd, h(a) = cdx please provide the homomorphic image of the regular expression h(r)
“Construct npda’s that accept the following regular languages: L1 = L(aaa*bab). L2 = L(aab*aba*). The union of L1 and L2.”
(III) Assume the alphabet >= {a,b). Give the set all strings over Σ of length less than or equal to 2 including the null string. For each of the following languages, which of the above strings are in the language defined by the following regular expressions. (Show your work clearly). (i) (ii) (iii) (iv) (v) (vi) (vii) (viii) a*b* a(ba)*b a* + b* (aaa)* (a+b)*a(a+b)*b(a+b)*a(a+b)* aba + bab (2 + a)b (a + ba + bb)(a+b)*
Let L be a language. It is clear from the definition that L+L*. Under what circumstances are they equal ?