If we are given with the two strings we have to find the longest common sub-sequence present in both of them. Example LCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3. LCS for input Sequences “AGGTAB” and “GXTXAYB” is “GTAB” of length 4. Implementation in Java

The operation Perm(w), applied to a string w, is all strings that can be constructed by permuting the symbols of w in any order. For example, if w= 101, then Perm(w) is all strings with two l's and one 0, i.e., Perm(w) = {101, 110, 011). If L is a regular language, then Perm(L) is the union of Perm(w) taken over all w in L. For example, if L is the language L(0*1*), then Perm(L) is all strings of 0's and 1's, i.e., L((0+1)*). If L is regular, Perm(L) is sometimes regular, sometimes context-free but not regular, and sometimes not even context-free. Consider each of the following regular expressions R below, and decide whether Perm(L(R)) is regular, context- free, or neither: 1. (01)* 2.0*+1* 3. (012)* 4. (01+2)* a) Perm(L(0*+1*)) is context-free but not regular. O b) Perm(L((01+2)*)) is context-free but not regular. c) Perm(L((01+2)*)) is not context-free. O d) Perm(L((01)*)) is regular.

Longest Common Subsequence:ExampleLCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.LCS for input Sequences “AGGTAB” and “GXTXAYB” is “GTAB” of length 4.Implementation in Java.

A cyclic permutation of a string takes the string and shifts each letter forward by a constant amount k, with letters that shift off the end of the string coming back in at the front. For instance, the cyclic permutations of the string ABCDEF are FABCDE, EFABCD, DEFABC, CDEFAB, BCDEFA, and ABCDEF itself. A reverse cyclic permutation is the reverse of a cyclic permutation; for instance ABCDEF has the reverse cyclic permutation DCBAFE amongst others. Given two strings S and S", provide a linear time algorithm to decide whether S is a reverse cyclic permutation of S'.

in java replit code please

Write a Java program to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string. Provide an explanation of the code and its time and space complexity.

Use python

Computer Science Q2.Write a java program to implement the concept of Horspool string matching algorithm to find the pattern in the Text Text STRING MATCHING Pattern : ING Java code i want solved very quickly

program bust be solved by python anaconda .My variant number is ( 21 )