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

Given the following DFSM M, the correct statements are: S a, b a,b T □ (aa Uab Uba U bb)* is a regular expression that generates L(M). (ab Uba)* is a regular expression that generates L(M). □S → E, S → aT, S→ bT, T→ aS, T→ bS are the regular grammar rules that generate L(M). SaT, S→ bT, TaS, TbS are the regular grammar rules that generate L(M).
1) Using CYK Algorithm, determine whether the strings aab and abbbb are in the language that is generated by the following grammar:S → AB, A → BB|a, B → AB|b 2) For each of the following CFLs L, give a "direct" design of an NPDA (no solutions with CFG pls). i) L1 = {a^n b^m : 0 ≤ n ≤ m ≤ 3n} ii) L2 = {w ∈ {a, b}* : n_a (w) ≤ 3n_b(w)} (n_a means n subscript a and n_b means n subscript b) PLS NO AI GENERATED SOLUTIONS, THANKS A LOT
Let Σ {a, b, c}. Use the Pumping Lemma to show that the language L defined below is not regular: L = {wb"wR:n > 2, w e {a, c}+}
Given N = (Q, {a, b}, δ, q0, F) is an NFA that recognizes language L. Define a new language concatenate(L) that is formed by concatenating symbol a to the end of every string in L. That is, concatenatea(L) = {wa | w ∈ L(N)}. Please construct an NFA N′ with exactly one accepting state that recognizes language concatenate(L). All you need to do is fill in the missing parts in the definition below. N′ = (Q′ , {a, b}, δ′ , q′ 0 , F′ ) where (a) Q′ = (b) q ′ 0 = (c) F ′ = (d) δ ′ is defined as follows:
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 +.
For the language {a^n | n mod 2=1}, give are gular expression for this language 1 and give a context-free grammar that generates this language.
Fill out the table for executing the polynomial-time dynamic programming algorithm for deciding whether the string 1001 is in the context-free language generated by the following CFG. Fill the table completely—do not stop the algorithm early. (Note: This CFG is not quite in Chomsky Normal Form since A appears on the right-hand side of a rule, but the same algorithm still works.) A → BC | CC B → BA | 0 C → AB | BB | 1
2. What is the TG corresponding to the language of strings, over alphabet {a, b}, that are composed exactly of odd repetition of the substring ab, i.e. sample strings of this language are ab, ababab, ababab, etc.
This question is about context-free grammars and parsing, and Turing machines (TM’s) i) Consider the following context-free grammar G over the alphabet Σ = {a, b, c}: S → aSb | ε | acSba | abc where S is the start variable. Using the rules of the grammar G, construct parse trees for thewords aabcb and aacbab. ii) Give 2 words (from Σ∗) that are not in the language accepted by the grammar G of Question i.Justify your answer, explaining why are the words you give not accepted
1 1.12 3 4. 5. . ... Theorem: Let G= (V,T,P.S) be a rghtlimear grammar. Then there exists a language L(G) which is accepted by a FA. i. , the language generated from the regular grammar is regular language. 1/1 lilil
Formalize the following sentence in english: 3X. elephant(X)|
Consider the Finite Automata D in Figure 2. a. List 3 strings of different lengths that D accepts and also 3 that it rejects. b. What is the shortest string that D accepts? What is the shortest string that D rejects? c. Describe, in your own words, what is the language of D, i.e., L(D). 93 42 Figure 2. Finite automata D