9. Let Li and L2 be arbitrary languages, subject to the specification in either (i) or (ii).Consider the following four questions:(Q2) Is L1-L2 empty?(Q4) Is LINL2 empty?For each of these four questions explain with reasons whether the general problem is(Q1) Does L1-L2 contain a given fixed word w?(Q3) Does LINL2 contain a given fixed word w?recursive, not recursive but r. e., or non-r. e., provided(i) Both Li and L2 are recursive.(ii) Li is r. e., but not recursive and L2 is recursive.Note that there are eight different questions to be answered.

9. Let L1 and L2 be arbitrary languages, subject to the specification in either (i) or (ii). Consider the following four questions: (Q1) Does L1-L2 contain a given fixed word w? (Q3) Does LinL2 contain a given fixed word w? For each of these four questions explain with reasons whether the general problem is recursive, not recursive but r. e., or non-r. e., provided (i) Both Li and L2 are recursive. (ii) Li is r. e., but not recursive and L2 is recursive. (Q2) Is L1-L2 empty? (Q4) Is L1OL2 empty? Note that there are eight different questions to be answered.

9. Let L1 and L2 be arbitrary languages, subject to the specification in either (i) or (ii). Consider the following four questions: (Q1) Does L1-L2 contain a given fixed word w? (Q3) Does LinL2 contain a given fixed word w? For each of these four questions explain with reasons whether the general problem is recursive, not recursive but r. e., or non-r. e., provided (i) Both Li and L2 are recursive. (ii) Li is r. e., but not recursive and L2 is recursive. (Q2) Is L1-L2 empty? (Q4) Is L1OL2 empty? Note that there are eight different questions to be answered.

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

Related questions

Q: Match the structures below with the kinds of languages that they are able to recognize. Not all…

A: In the Theory of computation, lots of languages are available there are various types, and it is…

Q: (a) Show the internal representation (box-pointer diagram) of the LISP list as obtained below: > ( l…

Q: 3. Prove that the following grammar is ambiguous by drawing two different parse trees of the same…

A: Answer: Let the word is "aaabb"

Q: 1. The subset sum problem is stated as follows: Given a set S {a, a, a, a,} of n positive integers…

A: A naive solution would be to cycle through all the subset of n numbers and, for every one of them,…

Q: Hi, I need special Help. So my professor gave me some PP's to study from and i provided to…

A: Constructs-Their are basically three types of constructs. They are- if statement while loop for loop…

Q: 4. What does the following Lisp function do? (defun myfun (1st) (cond ((null lst) ()) ((equal (car…

A: Defun can be used to define a new function, to install a corrected version of an incorrect…

Q: Consider the finite automata C in Figure 1. a. Provide a formal definition for C (as covered in…

A: a. Finite automata Finite automata is a mathematical model of system with discrete inputs and…

Q: 1) Grammar G is N→DIND D→0|1|2|3|4|5|6|7|8|9 What is the language L(G) specified by G? Write the…

A: Given Grammar is, N→D|NDD→0|1|2|3|4|5|6|7|8|9 In this grammar, N, D are variables.

Q: (2) Fill the proper words in the blanks: it can be accepted by a DFA. A language is context-free (i)…

A: Answer : Part 1 A language is regular if and only if it can be accepted by a DFA . A language is…

Q: Q. The formal description of a NFA (Nondeterministic finite automaton) is: ({qı, q2}, {0,1}, 8, qı,…

A: Regular expressions are patterns used to match character combinations in strings. A regular…

Q: (b) Argue that the language {a"b"|n = 0,1,...}U{b"a"|n = 0,1,...} over the alphabet {a,b} belongs to…

A: 1) Binary strings of even length is as follows: L = {0011,01,0000,11,1100}…

Q: show that Every context-free language is a member of P.

A: All regularly used languages are context-free but all context-free languages which we use in the…

Q: Let Γ be a set of sentences of L1 (the language of propositional logic) and let φ be a sentence of…

A: Let Γ be a set of sentences of L1 and φ a sentence of L1. The argument with all sentences in Γ as…

Q: How would you go about showing that recursive languages are closed under union using a constructive…

A: How would you go about showing that recursive languages are closed under union using a constructive…

Q: Give a decision procedure for each of the following problems; argue that your procedure is correct:…

A: Below i have analysed both the question and provided answer with reason:

Q: escribe the same class of lang is closed under union.

A: The first three questions will be answered only. a) Every regular language is said to be a…

Q: (1) Grammar G is N →D|ND D 0|1|2|3|4|5|6|7|8|9 What is the language L(G) specified by G? Write the…

A: Given Grammar is, N→D|NDD→0|1|2|3|4|5|6|7|8|9 In this grammar, N, D are variables.

Q: Consider the following two variable bindings in Lisp: (setq x ‘(a b c d)) (setq y ‘(4 3 2 1))…

A: General guidance The answer provided below has been developed in a clear step by step manner. First…

Q: Suppose a Prolog database exists that gives information about the parts in an automobile engine.…

A: a. Query for finding all small items that are part of other items: ?small(X) and partof (X, Y))

Q: Show, formally in terms of DFAs, that if L0 is a regular language (has a DFA) and L1 is a regular…

A: So DFA stands for Deterministic Finite Automata .It can determine the state to which the machine…

Q: Question: 1. Using the pumping lemma for context-free languages, prove the following language is not…

A: here i am applying pumping lemma to satisfy , that is not context free language.…

Q: . List some legal inputs of grammar G. Try to describe the same language in some other ways. (1) S→…

A: The language generated by grammar G is a set of strings consisting of one 0 followed by zero or more…

Concept explainers

Bare bones programming language

Bare bones programming language is a low-level programming language that gives a detailed stepwise description of a program. It has a tight program design and in-depth understanding of the toolchain. It is based on the target environment and is used for safe coding practices. C programming language is a type of bare bones programming language.

Question

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

4. Given the grammar from the previous problem if the string is in the language show the parse tree, right most derivation, handle, phrases and simple phrases for the following strings, or prove they are not in the language a. abBbcC wwwwwww b. acccd c. aCbaacd wwwwww d. acdabd e. abCbad
Provide DFA diagrams to recognizes the same languages as each of the regular expressions in a. The set of chess moves, in the formal notation, such as p-k4 or kbp x qn. b. All stings of a’s and b’s that do not contain the substring abb. c. All strings of a’s and b’s that do not contain the subsequence abb.
Please Answer this matching question
1 1.12 3 4. 5. . ... Theorem: Let G= (V,T,P.S) be a rghtlimear grammar. Then there exists a language L(G) which is accepted by a FA. i. , the language generated from the regular grammar is regular language. 1/1 lilil
Please solve complete
Need step by step details solution
Give solution of subpart 4 and 5. Subject: Theory of Automata