Which of the following regular grammars generates the same language as the regular expression a(b + c)(d)? Assume that the starting symbol is S and that unit productions are allowed. OS a A A → bA | CA | D D → dD | H H→ A OS → aA AbS cS D DdS H H→ A OS→ aA A → bA CA A → dA | A OS A a A bA cA bD cD DdD dH 1 H→ A

Which of the following regular grammars generates the same language as the regular expression a(b + c)(d)? Assume that the starting symbol is S and that unit productions are allowed. OS a A A → bA | CA | D D → dD | H H→ A OS → aA AbS cS D DdS H H→ A OS→ aA A → bA CA A → dA | A OS A a A bA cA bD cD DdD dH 1 H→ 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

3. Give a context-free grammars that generates the following languages: (a) {w | w contains at least three 1s} (b) {w | w has an odd length}
Q1: Provide context-free grammar that creates the following languages using PDA. (a) { w ∈ {0, 1}∗ | w contains at least three 1s } (b) ) { w ∈ {0, 1}∗ | w = wR and |w| is even }
Construct a context free grammar which generates the same language the following PDA accepts. Explicitly state what the start symbol of your grammar is. 1 d,x-E E,ε→$ a,ε-x 4 2 b,ε-x f,x->E ε, $→E C,X→E LO 5 3
Provide the rules for context-free grammars that generate the following languages. L4 = {w ∈ {a, b, c} | |w| ≥ 3, |w| is odd, and the first symbol, middle symbol and last symbol of w are all different }
Given the following grammar: A-> aA |a|B B -> bB | b Which production rule below represents a correct rewrite for nonterminal A that would eliminate the chain A -> B? O A-> aA} a| bB | b O A-> aA | a O A -> aA |a| B| bB | b O A-> aA|a| B| bBB | bB
Convert the following grammar to Chomsky normal form. S→ ASA | A | e A → aa | E
Convert the following Grammar to Chomsky normal form, upload a docx of your solution: S → aS | Sb | bT | U T → Ta | cUc | V | null U → aUa | S | null V → dV | d Please only provide the normal form :
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) В. О(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)
5. Construct npda that accept the following context-free grammars: (a) S -> aAB | bBB A -> aA | bB | b B -> b (b) S -> ABb | a | b A -> aaA | Ba B -> bb
2. Are the following languages context-free or non-context-free? • If a language is context-free, give a context-free grammar that generates it. • If a language is not context-free, prove this using the pumping lemma. A = { a*b'c*d² |k > i > 0, l>0 } B = {a²i+1fk+1c3l (2k+1q* | i > 1, k > 1, l > 1 } (a) (b)
5. Convert the following grammar to Greibach Normal Form S- AaA | CA | BaB A → aaBa | CDA | aa | DC B → bB | bAB | bb | aS C - Ca | bC | D bD |b