(a) All strings with exactly one a. (b) All strings with at least one a. (c) All strings with no more than three a's. (d) All strings with at least three a's. (e) All strings with at most one b. (f) All strings with at least two b. (g) All strings with no more than two substring ab's. (h) All strings starting with a and ending with b. (i) All strings having aba or bab. (j) All strings having the second last symbol is a.

(a) All strings with exactly one a. (b) All strings with at least one a. (c) All strings with no more than three a's. (d) All strings with at least three a's. (e) All strings with at most one b. (f) All strings with at least two b. (g) All strings with no more than two substring ab's. (h) All strings starting with a and ending with b. (i) All strings having aba or bab. (j) All strings having the second last symbol is a.

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

Let G = (V, T, S, P ) be a phrase-structure grammar with V = { 0, 1, A, S }, T = { 0, 1 } and the set of productions P consisting of S →1 1S, S →2 00A, A →3 0A, A →4 0. A. Show whether 111000 ∈ L(G). B. Show whether 11001 ∈ L(G).
Let G = ( V, T, S, P ) be the grammar with V = { a, b, c, S }, T = { a, b, c } and the set P of productions S →1 abS, S →2 bcS, S →3 bbS, S →4 a, S →5 cb. Construct derivation trees for the following strings. A. bcbba B. bbbcbba C. bcabbbbbcb
Grammar and its application to FractalsLet G=(N,T,P,∑) where ∑ is the start symbol, N = {D}, T = {d, r, l}, andP = {∑→D, D→DrDllDrD, D → d} 1. Give the most specific type of grammar G.2. Show the leftmost derivation sequence of the string drdlldrd, (i.e. When deriving a new sentential form, always replace one Nonterminal at a time and always replace the leftmost Nonterminal)3. Suppose d is an abstraction of a command to draw a straight line of fixed length in the current direction, r is an abstraction of a command to turn right by 60 degrees, and l is an abstraction of a command to turn left by 60 degrees. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure represented by the generated string drdlldrd.4. The string drdlldrdrdrdlldrdlldrdlldrdrdrdlldrd can also be generated. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure…
L = {(a^n)(b^m)(c^k) ; n = m or m ≠ k } Find context free grammars (with n, m, k greater than or equal to 0)
Question 2-Context-free Grammars Consider the alphabet = {A, V., (,), x, y, z) and the following grammar G = (V,E, R, F), defined by the rules: F (FAF) | (FVF) | (F) | P (a) Identify the set of variables and the set of terminal symbols of G. (b) Identify three words (of lengths between 10 and 20) that can be generated by the above grammar and show their derivations. (c) Consider a modified grammar G', where we remove the brackets '(' and ')' from the alphabet and the derivation rules. That is we set Σ'= {A, V., x, y, z) and we remove all occurrences of brackets in the derivation rules. Show that there are words that are derived ambiguously in G'
Q) Identify whether the given grammars are ambiguous or not with help of parse tree and convert each grammar to CNF format a) S → SAB | ∈ A → AaB | a B → AS | b b) S → aSSS → b This question is from Theory Of Automata Subject.
1)Let G = (V, ∑, R, S) be a grammar with V = {S, H, Gm J}; ∑ = {h, g, j}; and the set of rules: S → H H → h | hJG G → Gg | Sg | HgJ J → jH | HHJ| Jj a)Convert this grammar to a PDA using the method we described. b)Convert G to Chomsky normal form.
Determine the type of the following grammars into the Chomsky Hierarchy(e.g. Type-0, Type-1, Type-2 and Type-3). 4.)G=({x,y}, {C,A,B,S}, S, P),P={S::=Cx, S::=Cy, S::=By, S::=Ax, S::=x, S::=y, A::=Ax, A::=Cx,A::=x,B::=By, B::=yA, C::=xA} 5.)G=({a,b,c}, {S,B}, S, P),P={S::=abc, S::=aBSc, Ba::=aB, Bb::=bb}
answer the following and explain Establish that L is context-free by building a CF grammar for L = {0n1m: n does not equal 6m and n,m ≥0}
Exercise 18 Consider the following grammar. <list> ::= <element>,<list> | <element> <element> ::= <letter><digit> <letter> ::= A | Y | B | U <digit> ::= 1|2|3|4Which of the following string can be derived from the grammar? A. A1Y1 B. AYBU C. 1Y D. A,Y,B,U E. A1,Y2,B4,U F. A1,Y2,B4,U3,1A G. A1,Y2,B4,U3
Consider the grammar G = ({S, A}, S, {a, b}, P) with the following set of production rules P: S → aS|baA|abaAA → aAbb|aAb|ε 1. Determine what the language generated by G is. You may only use set builder notation and/or language operators in your answer. A proof is not required. 2. Show that the grammar G is ambiguous by: (a) Providing two distinct leftmost derivations for the same string w ∈ L(G).(b) Providing two distinct parse trees for the same string w ∈ L(G).
Let be the following LL(1) grammar with empty rules: a-) Prove that it is an LL(1) grammar with empty rules.b-) Build the recognition table.c-) Test step by step if it is possible to recognize the string abbc#.