One of the following questions is decidable and the other is undecidable. For the undecidable question prove undecidability and for the decidable one give an algorithm. Your algorithm can use known algorithms as basic steps. You should not describe well-known graph algorithms or algorithms covered in class in detail. Here L is a context-free language with a given grammar and R is a regular language with a given DFA; both are over the same alphabet Σ. 1. LNR= Ø 2. LUR= E*

One of the following questions is decidable and the other is undecidable. For the undecidable question prove undecidability and for the decidable one give an algorithm. Your algorithm can use known algorithms as basic steps. You should not describe well-known graph algorithms or algorithms covered in class in detail. Here L is a context-free language with a given grammar and R is a regular language with a given DFA; both are over the same alphabet Σ. 1. LNR= Ø 2. LUR= E*

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

The correct statements are: To encode the union operation into a language recognition problem, we can define L = {U= : where A, B, C are sets and AUB=C}. A graph can be encoded as a string. All problems can be transformed into decision problems. All problems can be transformed into language recognition problems.
L = {am+n bm cn | m,n ≥ 1} over Σ = {a, b, c} A. Design PDA for L (with as less as states possible) B. Is L is regular language? C. Verify it by Pumping Lemma
Find CFGs that for these regular languages over the alphabet Σ = {a, b}. Draw a Finite Automatafirst and use this to create the CFG.(a) The language of all words that contain the substring aba.(b) The language of all words that have an odd number letters and contains the string bb.(c) The language of all words that begin with the substring ba and contains an odd number ofletters.
There are two restrictions on the type of grammars that can be used with a recursive descent parser. The first is that the grammar cannot have any left recursive productions. Give an example of a left recursive production and explain why such productions would be a problem. The second restriction is that the grammar must not require more than one token look ahead. Give an example of a production that does not have this property. Explain why this restriction is necessary for recursive descent parsing. Rubrics
Fill out the table for executing the polynomial-time dynamic programming algo- rithm 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 с + АВ | Вв | 1
Giventhegrammar B-> BB | (B) | ε 1.Describe the language it generates 2.Show that it is ambiguous
need help
The language Balanced over E = {(,)} is defined recursively as follows 1. ЛЄ Вalanced. 2. Vx, y € Balanced, both xy and (x) are elements of Balanced. A prefix of a string x is a substring of x that occurs at the beginning of x. Prove by induction that a string x belongs to this language if and only if (iff) the statement B(x) is true. B(x): x contains equal numbers of left and right parentheses, and no prefix of x contains more right than left.
Let A be a language such that A ≤m PCP and ETM ≤m A. What can you say about A? Briefly explain your answer.
If the languages are regular, give an automaton. Otherwise, show it is notregular by using pumping lemma. L = {b2anbma3 | m = n}. Note: this is not the same question as L = {b2anbma3 | m, n ≥ 0}. If the solutions are the same please clearify.
Let L be a language and its strings are defined by the following recursive relation. Sn=a Sn-1(Sn-2)? where n>=2, So=a, Si=ac Is L regular? Justify your answer. If your answer is yes, construct a regular expression to generate the language L. Otherwise, prove that language L is not regular.
Only typing answer Please answer explaining in detail step by step without table and graph thankyou