Please help me quickly ExerciseThe longest palindromic subsequence problem is a classic variation of the Longest CommonSubsequence (LCS) problem. The idea is to find LCS of the given string with its reverse, i.e., call LCS(X,reverse(X)) and the longest common subsequence will be the longest palindromic subsequence.1- We consider the sequence X = ABBDCACB. Apply the appropriate dynamic programmingalgorithm to compute the longest palindrome sequence and it is length. You must show all thecomputing steps.Exercise 2Find an optimal solution for the knapsack instance n (number of objects) -7 and W (total weight) -15, insuch a way that the total weight is less than or equal to a given limit and the total profit value is aslarge as possible. Profits and weights of each object are as follows(p1, p2p7)(10, 5, 15, 7, 6, 18, 3)(w1, w2.........w7) = (2,3,5,7,6,4,1)

Exercise:To solve the Longest Palindromic Subsequence (LPS) problem for the given sequence X =…

Answered: Exercise The longest palindromic…

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

Show that the problem L (M) contains any string that contains at least 3 consecutive a’s is undecidable.
2) Is aa distinguishable from bb with respect to the set of strings over {a,b} that have an even number of a's? If so, prove it.
Let M be the language of all binary strings that contain the substring 11 and whose number of 0’s is even. (For example, 0101100 is in M.) (a) Give a largest possible set of strings that are pairwise distinguishable with respect to M. (b) Give a largest possible set of strings that are pairwise indistinguishable with respect to M.
4. Show that it is undecidable if every string in the langauge of a TM has even length.
Consider the set of strings on {0, 1} defined by the requirements below. For each, construct an accepting dfa. (1) Every substring of four symbols has, at most, two 0’s. For example, 001110 and 011001 are in the language, but 10010 is not because one of its substrings, 0010, contains three zeros. no hand written
Let E = {0,1} and La be the language of all strings that represent binary numbers that are not divisible by 4. L, be the language of all strings that end with 0. d) We know that La and L, are both regular. But what about their complements, La and L,? Justify your answer. e) Show that (L. n L,), the intersection between La and Lp, is also a regular language.
Let E={〈M〉| M is a TM and every string in L(M) has even length}. Argue that the property described in E is not trivial – i.e., that Rice’s theorem applies to E.
Given two strings X and Y, where X consists of the sequence of symbols X1, X2, Xm and Y consists of the sequence of symbols y₁,Y2, ***,yn. Consider the sets {1, 2, ..., m} and {1, 2, ..., n} as representing the different positions in the strings X and Y, and consider a matching of these sets, where a matching is a set of ordered pairs with the property that each item occurs in at most one pair. A matching M of these two sets is an alignment if there are no "crossing" pairs: if (i,j). (i*,j') = Mandi 0 that defines a gap penalty. For each position of X or Y that is not matched in M (it is a gap), we incur a cost of 8. Second, for each pair of letters p and q (p + q) in our alphabet, there is a mismatch cost of app for lining up p with q. Thus, for each (i,j) = M, we pay the appropriate mismatch cost axiy for lining up x; with y;. The cost of M is the sum of its gap and mismatch costs, and the problem seeks an alignment of minimum cost. Define the minimum alignment cost OPT(i,j) (0 ≤ i ≤…
Construct an NFA for the set of all strings w *epsilon* {a,b}*; such that (1) w contains both aa and bb, or (2)w does not contain aa and w does not contain bb.
Consider a DFA over E = {a, b} accepting all strings which have number of a's divisible by 6 and number of b's divisible by 8. What is the minimum number of states that the DFA will have?
11 Express the function F(A, B, C)=A+B'C in a sum of minterms form. F(A.B.C) = 2 m(0,2,5,6,7) OF(A,B,C) = Σm(1,2,5,6) OF(A, B, C) = m(1.3,5,6) F(A.B.C) m1,4,5,6,7) he 2
Create an algorithm for parallel regularity testing.Input: a set S of permutation group G generators on;The output indicates whether G is regular or not.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS