Given a regular grammar G = {{S, T, a, b}, {a, b}, R, S}, where R = {S→ E, SaT, S → bT, T → aS, T → bS}, the correct statements are: L(G) = {[w€ {a, b}*: |w| is odd}. L(G) = {w€ {a, b}*: |w| is even}. a*b* is a regular expression that generates L(G). Ob*a* is a regular expression that generates L(G).

Given a regular grammar G = {{S, T, a, b}, {a, b}, R, S}, where R = {S→ E, SaT, S → bT, T → aS, T → bS}, the correct statements are: L(G) = {[w€ {a, b}: |w| is odd}. L(G) = {w€ {a, b}: |w| is even}. ab is a regular expression that generates L(G). Oba is a regular expression that generates L(G).

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

3. Let L = {abcm | n,m E N}. Create a context-free grammar for L starting with non-terminal S. 4. b.A: push(E) b,X; push(B) a.A: push(A) a,X; push(A) Consider the given PDA with bottom stack symbol X. It corresponds to a regular language. Create a regular expression for the language accepted by this PDA. A.B: nop A, E; nop c.B:nop q1
Provide a (CFG) context-free grammar that generates the following language of all strings over alphabet {0,1} with twice as many 0's as l's. i.e: strings 001010, 110000, 010, 100, 010001 are in this language, while strings 0110, 1, 0, 0000000001 are not. Prove that your grammar is correct.
1. Prove that the language L(G) is not regular where G is the following context-free grammar: G = ({S,A,B,C}, {a,b}, {S->bB|C, A>b|C, B->Sb, C->aAa }, S). Note: You must first determine L(G).
Computer Science
Pumping lemma Show that the language l is not context free {L = x^xyy^a+1x^b+1|a,b=>1}
What is the equivalent regular grammar for the following context free grammar?. S→AB; A→aa; B→ aB | bB | A; O A. SaS | bs | A; A→ aB; OB. O C. O D. SaA; A→ aA | bA | a; B-a S-aA; A→ aB; B→ aB | bB | A; S-as | bs | aA; A→ aB; B→ aB | bB | λ;
Given the following EBNF grammar: A -> [B, C,] D B-> '(, E, F, '), E C-> ', G D->-, G E -> " " F-> "o", "D", G-> "I" Give an example sentence that is within the grammar. NB: you can ignore whitespace.
Let Σ={0,1,a}. The language L that we are interested in is all and only the stringsthat do NOT contain the substring 01.We can write a context-free grammar (CFG) for it:S → 0A | 1S | aS | εA → 0A | aS | ε It is a regular language. Write the regular expression (regex) for this language .
Given a regular grammar G and a list of strings, identify the strings that are in L(G).
Formal language Let’s define languages: L1 = {wan | w is an arbitrary string containing a’s and b’s, of length n}, Σ = {a, b} L2 = {w | 01∗0(11 + 00)∗} , Σ = {0, 1} For every language, define a context free grammar (CFG) for it.
Let G be the context-free grammar below. Use the brute force parsing algorithm studied in class to prove that w = aab does not belong to L(G). Do not use other methods. Show all work in all rounds needed. Label the rounds. [Hint: The number of rounds aS | BS | a; B ->bB | b
Let { a b } be the alphabet set. Write a Context free grammar CFG for each of the followinglanguages:a) L = Language of all palindromeb) L = language of equal no of a’s and b’c) { \ m ≠ n, m, n ∈ N}d) R.E. = b(a+b)*e) R.E. = (ab + b)*f) R.E. = ab(ba)* + bb please solve all the parts kindly