please solve question 3automata Problem 1. List the first 3 strings of the following languages:a) L = {b"aa: n ≥ 2}b) L = {a" cb": n ≥ 0}c) L = {(bab)": n ≥ 0}d) L = {abwba: w € {a,b}"}e) L = {a³n bam:n, m≥ 1}f) L = {w: w E E' and Σ = {a,b} and |w|mod 3 = 0}g) L = {w₁aaw₂: W₁ E {a,b} and w₂ € {c,d}" }h) L = {w: w E E' and Σ = {a,b} and Na(w) mod 3 = 2 and N₁ (w) ≥ 0}i) L = {waw: w E E+ and Σ = {x,y}}Problem 2. (Operations on languages)let L₁ = {10,011), L2 = {2,0, 111}, L3 = {1(101)": n ≥0}, L4 = {cma": n ≥ 2, m≥ 0} andL5 = {w: w€ {a,c}* and Na(w) ≥ Ne(w)},a) List the strings in Eº.(concatenation 0 times), Σ = {0,1}b) List the strings in 2³.(concatenation 3 times), Σ = {0,1}c) List the strings in L 1L 2. (concatenation), Σ = {0,1}d) List the first 5 string in L2. (Kleene star)e) List the strings in L2nL3.f) List the strings in L4 L5.g) List the strings in L4 UL5.h) Write L3 in set builder notation (pattern/rule).Problem 3. Write the following languages in (Set builder /Pattern/Rule) notation?a) The set of strings over {a,b,c} that contain the substring bb.b) The set of strings over {a,b,c} that end with bb.c) The set of strings over {a,b,c} that begin with bb.d) The set of strings over {a,b,c} in which the number of a's in the string is even.e) The set of strings over {a,b,c} in which the length of the string is multiple of 5.f) The set of strings over {a,b,c} in which the total number of a's,b's and c's is greater than10.g) The set of strings over {a,b,c} in which the total number of b's and c's is 5.

According to answering policy i can answer only 3 parts for remaining parts please resubmit again…

Problem 3. Write the following languages in (Set builder /Pattern/Rule) notation? a) The set of strings over {a,b,c} that contain the substring bb. b) The set of strings over {a,b,c} that end with bb. c) The set of strings over {a,b,c} that begin with bb.

Problem 3. Write the following languages in (Set builder /Pattern/Rule) notation? a) The set of strings over {a,b,c} that contain the substring bb. b) The set of strings over {a,b,c} that end with bb. c) The set of strings over {a,b,c} that begin with bb.

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

2- Write CFG for the following languages a) L= {anb²n, n>0} b) L= {a²nbn, n>0} c) L= {ww}, w={a,b}* d) L= {anb²n, n>0} U {ww}, w={a,b}*
1. For the following language a) Give a DFA b) Give an NFA c) Give an 8-NFA {0n1m | n>0, m>0, the remainder of n+m divided by 3 is 2}
Just need questions 4,5,6
4. Enumerate the first four strings in the following languages, where E = {0, 1}: Let L2 = {w: w begins with 1} Let L3 = {w: w contains exactly one 1} a) LL3 b) L,* c) L2N L; d) L2 U L3 e) L2C
Just need answer
Q2 Combining languages Let L₁ = {ab, ba}, L₂= {b, aa, abba}, L3= {x|x {a,b}* ^ x ≤ 3} = {A, a, b, aa, ab, ba, bb, aaa, aab, aba, abb, baa, bab, bba, bbb}. Evaluate: (L₁-L₂) L3=
2- Write CFG for the following languages c) L= {ww}, w={a,b}* d) L= {anb²n, n>0} U {ww}, w={a,b}*
Q. Write the CFG for the following languages over Sigma (a, b)1) All words that don’t end at double letter.2) All words that contains at least three ‘b’.3) Language of anb2n, where n>=1.4) Language of a3nbn, where n>=.5) W | the length of W is odd.
C++ Consider the language that the following grammar defines: <S> = c | <W> | c<S> <W> = abb|a<W>bb Write all strings that are in this language and that contain seven or fewer characters. If the answer includes multiple strings, you must enter the answers in alphabetical order. A. In alphabetic order, what are the two strings in this language that are 3 characters in length? B. In alphabetic order, what are the two strings in this language that are 4 characters in length? C. In alphabetic order, what are the two strings in this language that are 5 characters in length?
Determine whether the following languages are regular or not with proper justification. (i) L, = {a"bc" |n> 0} (1) %3D
6) Decide whether the following is a regular language or not. Tell why or why not.i) L = {aw1bw2| where w1 and w2  {a, b}*} (ii) L = { an| n = 2k, k ≥ 0} iii) L ={ u | u = www,  w  {a, b}*}
Consider the language L defined by these rewrite rules S->A | AX X->ABY | AB Y->ABCY | ABC BA -> AB CA -> AC CB -> BC A->a B->b C->c Question 1: (16) (a) Derive the string “a”. (b) Derive the string “aab“ (c ) Derive the string “aaabbc” (d) Derive the string “aaaabbbcc” (e) Describe the strings that are in L.