(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

Topic: Pumping Lemma
Consider the following two variable bindings in Lisp: (setq x ‘(a b c d)) (setq y ‘(4 3 2 1)) Using only the variables x and y and the functions car, cdr and cons, provide Lisp S-expressions for generating the following: (d c b a) (4 c (b 2)) ((a b c d) . 1) (((a c) (1 2)) . a) ((a 1) (b 2) (c 3) (d 4))
How do I find the language described by this Regular Expression- (a|b|c)*?
Use the Pumping Lemma to show that the language is not regular.. L = {0i10i | i >= 1}
5. Let L = {ablak | k>n+l}. a. List all strings of length 7. (use power notation: i.e. aabbbbaaaaaaaa is a²b¹a³)
Fast plz
Show that the following language is not context free. DO NOT use pumping lemma. {a*b"c"b" | n> k> 0}
For each of the following languages Ls {a, b}*, show that the elements of the infinite set {a"|n > 0} are pairwise L-distinguishable. (b) L={a'b' a*\k > i+ j}
Parenthesizing(parsing) lambda expression below (An . Af . Ax . f (n f x)) Ag . Ay .gy
For each of the following languages L, state whether or not L is regular. Prove your answer. You can prove it by finding a regular expression that describes the language or by finding an FSM that recognizes it. {w {a, b, c}* : w contains at least two occurrences of the substring ac or w contains no more than 3 c’s}.
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 +.