1. Which of the following regular expressions best describes L(G), where G is the left-lineargrammar { S → Ab | Ba , A → a| Aa , B → b| Bb }?A. aa*b + bb*aB. ab* + ba*C. (a+b)(a* + b*)2. Given an NFA M with n states and an arbitrary string x of length p, determining whetheror not x is in L(M) can be done inA. O(n+p)В. О(2а + р)C. O(np)D. O(p")steps.3. What is the simplest regular expression equivalent to (a*b*c* + c*b*a*)* ?A. (a + b+ c)*B. (abc + cba)*C. It is already in its simplest form.4. What does the egrep pattern "b?[ab]{1,2}" translate into?A. (b + ɛ)(a + b+ aa + ab + ba + bb)B. (bal + bb1 + ba2 + bb2)C. (al + a2 + b1 + b2 + ba1 + ba2 + bb1 + bb2)

The answers for all mcqs with explanation given below

1. Which of the following regular expressions best describes L(G), where G is the left-linear grammar { S –→ Ab | Ba , A a | Aa , B → b | Bb }? A. aa*b + bb*a B. ab* + ba* C. (a+b)(a* + b*) 2. Given an NFA M with n states and an arbitrary string x of length p, determining whether or not x is in L(M) can be done in A. O(n+p) B. O(2ª + p) C. O(np) steps.

1. Which of the following regular expressions best describes L(G), where G is the left-linear grammar { S –→ Ab | Ba , A a | Aa , B → b | Bb }? A. aab + bba B. ab* + ba* C. (a+b)(a* + b*) 2. Given an NFA M with n states and an arbitrary string x of length p, determining whether or not x is in L(M) can be done in A. O(n+p) B. O(2ª + p) C. O(np) steps.

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

Consider the following regular expression: (a*+b)+ Find the CFG for this expression. O A. S->AS | A; A->P|Q; P->AP | λ; Q->b; O B. S->AS | A; A->P|Q; P->aP | A; Q->bQ | λ; O C. S->AS | A; A->P|Q; P->aP | A; Q->bQ | b; O D. S->ASA; A->P|Q; P->ap | a; Q->b;
1. For the function defined recursively by f(0)=5 and f(n)=4f (n-1)+3, answer the following: a. Find a closed form representation for this function. Your closed form should not include any series. b. Prove that your representation is correct using a formal inductive argument.
For each of the following regular expressions over Σ = {a, b}, state 5 strings that are in the language of the regular expression, and 5 strings that are not. 1. (a∗b)∗|a∗2. (Σ∗aaΣ∗)|(Σ∗bbΣ∗)|(ab)∗|(ba)∗|a|b
Give regular expressions for the i (a) {w : w contains at most two 1s} (b) {w : w contains at least two 1s} (c) {w: every odd position in w is 1} (d) {w : w contains an even number of 0s, or
Let N = {0, 1, 2, . . .} be the set of Natural Numbers. Given an n ∈ N, which of the followingconditions are necessary, and which of these conditions are sufficient, for the Natural Number,n, to be a factor of 10.(a) 1 is a factor of n.(b) 1 is a factor of 2n.(c) −n is a factor of 10.(d) 10 is a multiple of n.(e) n is divisible by 2.(f) n^2 is divisible of 5.(g) n = 10.
Define a function S : Z+ → Z+ as follows. For each positive integer n, S(n) =the sum of the positive divisors of n. S (7) ?
Correct answer will be upvoted else downvoted. Computer science. string a matches an example b if for every I from 1 to k either bi is a special case character or bi=ai. You are approached to improve the examples so that the primary example the j-th string matches is p[mtj]. You are permitted to leave the request for the examples unaltered. Would you be able to perform such an improvement? Assuming you can, print any legitimate request. Input The primary line contains three integers n, m and k (1≤n,m≤105, 1≤k≤4) — the number of examples, the number of strings and the length of each example and string. Every one of the following n lines contains an example — k characters that are either lowercase Latin letters or highlights. All examples are pairwise unmistakable. Every one of the following m lines contains a string — k lowercase Latin letters, and an integer mt (1≤mt≤n) — the record of the main example the relating string should coordinate. Output Print "NO"…
5. Let A = {(G, a) | G is a CFG, a is a terminal symbol, and L(G) na' # Ø.} Show that A is decidable.
Q2 "Simplify the regular expression a:= (x*y)* + (x*(yx*)z)*(x*y)*xx* + ɛ defined over the alphabet E = {x, y, z} as much as possible benefiting Kleene Algebra axioms and rules (A.1) - (A.17). Clearly show simplification steps.
Given the functions G(a,b,c) = ∏M ( 1,2,3,5) and F(a,b,c) = ∑m (0,2,4,5 ), express F'+G as Product of Maxterms by filling in the single blank below:F'+G= ∏M (__?)
(a) Let L = {w E {0, 1}* : w does not end in 01} (a) Show a regular expression that generates L. (b) Show an FSM that accepts L.
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.