For cach language L over a given alphabet E, let (L, E) denote the language over E obtained from L by generating all permutations of its strings-that is, a(L., E) ( we E*: there is a string v in L such that w is a permutation of v ). Specify which one of the following statements is true. Choose None of the other statements is true. The language n((Ob1)*, (0, b,1}) is decidable. The language n((0b1)*, (0, b,1}) is regular. There is no regular language L over an alphabet E such that the language n(L, E) fails to be context-free.

For cach language L over a given alphabet E, let (L, E) denote the language over E obtained from L by generating all permutations of its strings-that is, a(L., E) ( we E: there is a string v in L such that w is a permutation of v ). Specify which one of the following statements is true. Choose None of the other statements is true. The language n((Ob1), (0, b,1}) is decidable. The language n((0b1)*, (0, b,1}) is regular. There is no regular language L over an alphabet E such that the language n(L, E) fails to be context-free.

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

Draw a deterministic finite automaton (DFA) that recognizes the language consisting of strings overthe alphabet {a,b} which contain either exactly two a's (which need not be consecutive) and anynumber of b's, or exactly two b's (which need not be consecutive) and any number of a's (and containsonly such strings.) Use JFLAP and submit the saved file.
Consider the language of all strings which contain two consecutive 0 that ? = {11, 111, 110, 011, 1111, 1110, 1101, 1100, 1011, 0111, 0110, 0011, … }. Give a RE corresponding to this language.
Given the following type of expressionsdata Expr a = Var a | Val Int | Add (Expr a) (Expr a) deriving Showthat contain variables of some type a, show how to make this type into instances of the Functor, Applicative and Monad classes. With the aid of anexample, explain what the >>= operator for this type doesI have solved for the Functor: instance Functor Expr where: --fmap :: (a->b) -> Expr a -> Expr b fmap g (Var x) = Var (g x) fmap _ (Val y) = Val y fmap (Add l r) = Add (fmap g l) (fmap g r).I hope this is correct, but im having a hard time solving the applicative this is my try: instance Applicative Expr where: -- pure :: Expr -> a pure a = Expr a -- <*> :: Expr (a->b) -> Expr a -> Expr b <*> =can you please help correct the functor and solve the applicative. Thank you very much!
Given a string S, find the longest palindromic substring in S. Substring of string S: S[ i . . . . j ] where 0 ≤ i ≤ j < len(S). Palindrome string: A string which reads the same backwards. More formally, S is palindrome if reverse(S) = S. Incase of conflict, return the substring which occurs first ( with the least starting index). Example 1: Input: S = "aaaabbaa" Output: aabbaa Explanation: The longest Palindromic substring is "aabbaa".
Draw a nondeterministic finite automaton (NFA) that recognizes the language of strings of lowercasealphabetic characters which don't violate the rule "'i' before 'e' except (directly) after 'c'." Thealphabet should be just the letters 'c', 'e', 'i', and 'x', where 'x' will stand for all lowercase letters otherthat 'c', 'e', and 'i.' Use JFLAP and submit the saved file.
Consider some input string s and some index i. The longestsubstring s[i], ... , s[j − 1] that is a valid expression consists of some number of termsadded together. In all of these cases, it begins with a term. By magic, assume that theGetTerm routine already works. Calling GetTerm(s, i) will return pterm and jterm, wherepterm is the parsing of this first term and jterm indexes the token immediately after thisterm. Specifically, if the expression has another term then jterm indexes the ‘+’ thatis between these terms. Hence, we can determine whether there is another term bychecking s[jterm]. If s[jterm] = ‘+,’ then GetExp will call GetTerm again to get the nextterm. If s[jterm] is not a ‘+’ but some other character, then GetExp is finished readingin all the terms. GetExp then constructs the parsing consisting of all of these termsadded together.
A finite sequence of symbols from a given alphabet will be called a string over the alphabet. A string that consists of a sequence a1, a2, a3, a4, … … … … , an of symbols will be denoted by the juxtaposition a1 a2 a3 a4 … … … … an. Given the strings: u = a2bab2and v = bab2, Evaluate the following operations for strings: (i) ԑu(ii) u + v(iii) u(u| v)(iv) v | (v | u)
For this problem, please kindly show your work Let ?L be a set of all finite binary strings that representing a binary number divisible by 2 (or 102102). What is a REGEX of ?L? Design an FA ?a such that ?a accepts ?L, i.e., ?=?(?)
Computer Science Let a M be a finite set of messages, and let S(M) denote the set of all permutations of M (all bijective functions f : M → M). We’ll assume that if given a description of σ ∈ S(M), both σ and σ −1 are efficiently computable. Suppose P ⊂ S(M) is such that ∀x, y ∈ M, ∃σ ∈ P such that σ(x) = y. (a) Show that |P| ≥ |M|. (This is easy, but makes sure you’ve parsed the definition.) (b) Show that if |P| = |M|, then the following encryption scheme is perfectly secure, provided you only use it once: 1 Key generation: select a random σ ∈ P; Encryption: m 7→ σ(m) Decryption: c 7→ σ −1 (c) (c) Show that the above is false if |M| < |P| < 2|M|. (d) Observe that for any finite group G and any g ∈ G, the map x 7→ gx is a permutation of G. By viewing G itself as a set of permutations of G in this way, show that the above property is satisfied (with M = P = G). (e) The traditional xor one time pad is a special case of the above. What is the finite group in this case?
Create a Deterministic finite automaton that takes in binary strings and accepts them which has both an odd number of zeros and a sum that is divisible by 3 (but no others). For example, 0111 should be accepted, but not 011 or 111.
Thanks in Advance 3. Give a Finite Automaton of the language, over alphabet {a, b}, of strings that end with b.
I need both java code and an explanation that includes the following: -A basic description/explanation of the algorithm -A reasoning for the time complexity of the algorithm Given is a sequence a1, a2, . . . , an of numbers. We say that its subsequence aj1 , aj2 , . . . , ajk , where 1 ≤ j1 < j2 < . . . < jk ≤ n, is kind-of-increasing, if for every three consecutive elements in this subsequence, the average of the first two elements is smaller than the third element. Formally, (aji+aji+1)/2 < aji+2 holds for every i ∈ {1, 2, . . . , k−2}. Design an O(n3) algorithm that finds the length of a longest kind-of-increasing subsequence of a1, . . . , an.