A = {a, ab, aab},A set of strings over the alphabet (a, b). For strings, we have an interesting notation to define the universalset U in this context. We take U defined by the Kleene closure (*) of the alphabet:U = {a,b}* = {a,b}¹ = {a,b}° U {a,b}¹ U {a,b}² U...izoAnswer the following questions.a) What is the shortest string in the universe for A?b) How many strings are contained in A?c) Write the contents of {a,b}⁰ U {a,b}¹ U {a,b}² in roster notation.d) Write the contents of A x A in roster notation. Note that when pairing up the strings, you areconcatenating the strings. Your final answer should not contain any pairs, only strings, and shouldnot contain any duplicates. To compute this, you can first compute the Cartesian product as usual,followed by removing the parentheses and commas.

“Since you have posted a question with multiple sub-parts, we will solve first three subparts for…

A = {a, ab, aab}, A set of strings over the alphabet (a, b). For strings, we have an interesting notation to define the universal set U in this context. We take U defined by the Kleene closure (*) of the alphabet: U = {a,b}* = {a,b)}¹ = {a,b}° U {a,b}¹ U {a,b}² U... (20 Answer the following questions. a) What is the shortest string in the universe for A? b) How many strings are contained in A? c) Write the contents of {a, b}° U {a,b}¹ U {a, b}² in roster notation.

A = {a, ab, aab}, A set of strings over the alphabet (a, b). For strings, we have an interesting notation to define the universal set U in this context. We take U defined by the Kleene closure () of the alphabet: U = {a,b} = {a,b)}¹ = {a,b}° U {a,b}¹ U {a,b}² U... (20 Answer the following questions. a) What is the shortest string in the universe for A? b) How many strings are contained in A? c) Write the contents of {a, b}° U {a,b}¹ U {a, b}² in roster notation.

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

Give a regular expression for the language of all strings over alphabet {0,1} that have exactly three non-contiguous 1s. (I.e., two can be contiguous, as in 01101, but not all three, 01110.)
We consider certain strings of length 6 over the alphabet S = {A,B,C}. We require that the string contains exactly two As, and exactly two B's, and exactly two C's. How many such strings are there? That is, how many strings of length 6 over the alphabet {A,B,C} contains exactly two A's, two B's and two C's?
Consider the set F = {1, −1, i, −i} with an operation ✕ defined by the table. ✕ 1 −1 i −i 1 1 −1 i −i −1 −1 1 −i i i i −i −1 1 −i −i i 1 −1 a ✕ b means find the entry in row a and column b; for example, −1 ✕ (−i) = i (the entry in row −1 and column −i). Find each of the following. (a) −1 ✕ i (b) i ✕ i (c) −i ✕ i (d) −i ✕ 1 (e) 1 ✕ i (f) −i ✕ −i
Given the sets A = { A, B, C, D} and B = {C, D, E}, what is A v B A-B
The format P(X) represents as a power set of given "X", (of all X's subsets) Now, assume there are two sets A= {q, w, e, r} and B = {w, r, f}. (a) What are the elements of P(A) ∩P(B )?(b) What is the cardinality of P(A ∪B )?(c) What is |P(A) ∪P(B )|?
A wave is modeled by the wave function: y (x, t) = A sin [ 2π/0.1 m (x - 12 m/s*t)] y1 (t) = A sin (2πf1t) y2 (t) = A sin (2πf2t) Using any computer program, construct the wave dependency graph resultant y (t) from time t in the case when the frequencies of the two sound waves are many next to each other if the values are given: A = 1 m, f1 = 1000 Hz and f2 = 1050 Hz. Comment on the results from the graph and determine the value of the time when the waves are with the same phase and assemble constructively and the time when they are with phase of opposite and interfere destructively. Doing the corresponding numerical simulations show what happens with the increase of the difference between the frequencies of the two waves and vice versa.
Define the set U = {x ∈ Z | ∃y ∈ Z, xy = 1} = {+1, -1}. We say a number p ∈ Z \ {0} is prime if and only if p ∉ U and ∀a ∈ Z, ∀b ∈ Z, p|ab ⇒ (p|a ∨ p|b). (intuitively this says you can’t build a prime p by combining things which do not already contain p) We say a number i ∈ Z is irreducible if and only if ∀a ∈ Z, ∀b ∈ Z, i = ab ⇒ (a ∈ U ∨ b ∈ U) (intuitively this says p is irreducible if the only things which divide it are 1 and p (and -1, and -p).) Prove that if x = ab ≠ 0 and x|a then b ∈ U.
Draw a DFA over the alphabet {a,b,c}that only accepts strings with no c's and an even number of a's, or an odd number of c's and an odd number of b's. For example, it should accept aa, aba, abbabaa, cbacabcb, cbcca, and abc but not aca, bacc, or aaa.
Write an algorithm for addressing the subset-superset problem in string matching. That is, search a text with several strings, some of which are factors of others. do not return any strings that are factors of other test strings found in text (b) Repeat with text consisting of 100 appended copies of and the test items
Given g = {(1,c),(2,a),(3,d)}, a function from X = {1,2,3} to Y = {a,b,c,d}, and f = {(a,r),(b,p),(c,δ),(d,r)}, a function from Y to Z = {p, β, r, δ}, write f o g as a set of ordered pairs.
Write a program that will undertake a range search of all elements lying within limits a, b along a dimension i of the multidimensional data set, represented as a k-d tree. For example, given the data set {(7, 5), (4, 2), (6, 8), (1, 4), (3, 5), (2, 4), (3, 7), (9, 1), (6, 6), (5, 1)} represented as a k-d tree (k = 2), a range search of data elements lying within (a = 3, b = 7) along dimension i = 2 yields {(7, 5), (1, 4), (3, 5), (3, 7), (6, 6)}
Write your own example of a set P containing 5 ordered pairs (x, y) such that P is not a function.