We have the language where {a,b} is the set of terminal symbols. Which set of production rules for G with start symbol S (a nonterminal) can generate it? (assuming all symbols involved other than the terminal symbols are in the alphabet as nonterminal symbols.) O O L(G) = {aa"ba" aln € Z,n >0}, DO SaAa, AaAa, A → b S→ baSba, S→ b SaAa, A→ bA, A → b SbaSab, S→b

We have the language where {a,b} is the set of terminal symbols. Which set of production rules for G with start symbol S (a nonterminal) can generate it? (assuming all symbols involved other than the terminal symbols are in the alphabet as nonterminal symbols.) O O L(G) = {aa"ba" aln € Z,n >0}, DO SaAa, AaAa, A → b S→ baSba, S→ b SaAa, A→ bA, A → b SbaSab, S→b

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

2. Let RE be the set of regular expressions over alphabet E = {0, 1}, and for r E RB, let L(r) be the language denoted byr. Consider the claim: VL E P(E"), Vri,ra € RE, (C(r1)) > 1AL\ C(r) = C(ri)) L is regular Either prove this, or find L,ri and ra that provide a counter-example.
Define these functions in SML Language with using the standard functions abs and length, and the Int.toString function, Predefined functions: real, floor, ceil,round, trunc, ord, chr, str, hd, tl,explode, implode, and null dont use pattern matching to solve the function
2. Consider the following language: {r € {a,b}* | #a(x) < 2#b(x)} (a) Give a CFG for this set. (b) Prove that the given CFG is correct.
Use the Pumping Lemma to show that the the following language over {a,b,c}* is not CF {wct | t ∈ {a,b}* ∧ w is a substring of t}
I need now
6. Let D = { w#u|where w and u are strings over {a, b} and |w| = 1.5 * |u]}. If D is a context-free language, then create a corresponding PDA or CFG. Otherwise, prove that D is not a context-free language using the pumping lemma.
2. The function f is defined for non-negative integers a and b recursively as follows: f (а, b) 3D1 if a = 0 or b = 0 f (a - 1, b f (a f (а, а) 1) + 2a - 1 if a if a > b if a < b b b, b) + f (b, b) + f (b а, а) } Compute f (2, 3) by drawing a recursion tree showing all of the computation required and then use your tree to compute the answer.
5. Find a closed form representation for the function defined recursively by f(0) = 5 and f(n+1)=2f(n)+4". Prove that your representation is correct using an inductive argument.
Solve this
Describe a DFA that accepts each of the following languages. Describe briefly what each state in your DFA means. Do not attempt to draw your DFA, since the number of states could be huge; instead, give a mathematically precise description of the states Q, the start state s, the accepting states A, and the transition function δ All strings x ∈ {0, 1}* such that x contains 0^9 as a substring, or |x| is divisible by 8, or #0(x) − #1(x) is divisible by 7. #0(x) denotes the number of 0's in x, and #1(x) denotes the number of 1's in x.
9. Limitation Question. Using the idea of Pumping Lemma, please explain, why we can't build a Finite Automaton to generate all and only strings of the form 1³n0n where n>=0.
Problem 1. Consider the regular expression (0|1)*1 over the alphabet {0, 1} What language does the regular expression describe? Use the Thompson's construction method to derive a non-deterministic finite automaton (NFA) that recognizes L. It is enough to draw the final NFA Use the powerset construction method to derive an equivalent deterministic finite automaton (DFA). You must show the computation of e-closures and draw the DFA Use the partitioning method to derive an equivalent, minimal DFA. You must show the partitioning steps and draw the minimal DFA