Let L = (x#y | x and y are bit strings, and x is a permutation of y} (x is a permutation of y means x and y have the same bits, but possibly in a different order.) For example, 0110# 1010 and 100111# 011101 are in the language. 101 # 001 is not (101 is not a permutation of 001) Use the pumping lemma for context free languages to prove L is not context free.

Let L = (x#y | x and y are bit strings, and x is a permutation of y} (x is a permutation of y means x and y have the same bits, but possibly in a different order.) For example, 0110# 1010 and 100111# 011101 are in the language. 101 # 001 is not (101 is not a permutation of 001) Use the pumping lemma for context free languages to prove L is not 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

Computer Science Suppose L ⊆{a, b}∗ is defined as follows: Λ∈L; for every x and y in L, the strings axb, bxa, and x yare in L. Show that L =AEqB , the language of all strings x in {a, b}∗ satisfying n_a (x) =n_b (x).
Build a DFA for following languages: (Σ = {0, 1}) L = { w | w is a binary string such that in every prefix the number of 0’s and the number of 1’s differ by at most 2.} L = { w | w is a binary string in which the number of occurrences of the substring 11 is even.} Note that string “111” has two occurrences of substring “11”
use the language operations (repetition, union, and concatenation). construct an NFA that realizes the language L over the alphabet {a, b, c} that consists of all strings that are either abc repeated any number of times, or an even length string with no as and ending in bc
-Give a DFA for the language {w ∈ {a,b}*| w does not end in ba} -Give a DFA for the language {w ∈ {a,b}*| #a(w) + 2#b(w) ≡5 0 } -Give a possibly nondeterministic FA (an NFA) that recognizes the following language: {w ∈ {0,1}*| w corresponds to the binary encoding of a positive integer that is divisble by 16 or is odd} -If w is a string, we let #a(w) denote the number of occurences of 'a' in w. Give a formal recursive definition of the function #a.
Find the regular expressions describing the following languages defined over the alphabet Σ = {0,1}: L1 = {0n1m : n ≥ 2, m ≥ 1, n+m ≥ 4} 2. L2 = {x : |x| mod 3 = 0} 3. L3 = {pqp : p,q ∈ {0,1}* and | p | = 3}
For the infix expression given below, obtain (i) the equivalent postfix expression,(ii) the equivalent prefix expression and (iii) evaluate the equivalent postfixexpression obtained in (i) using the Algorithm EVAL_POSTFIX(), with A = 1, B = 10, C = 1, D = 2, G = –1 and H = 6. (−(? + ? + ?) ↑ ?) ∗ (? + ?)
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.
Question 5 Let I be the set of all even length binary strings. (So I is decidable.) Give an example of a language K ⊆ I with K undecidable. Here you need to define the set K and state your reasoning why the K you define is undecidable. Full explain this question very fast solution sent me step by step text typ work only
Find the equivalent postfix, prefix, and prefix expressions for the following infix expression. Then, using the algorithm EVAL_POSTFIX() and the values A = 1, B = 10, C = 1, D = 2, G = -1, and H = 6, evaluate the corresponding postfix expression found in (i). (−(? + ? + ?) ↑ ?) ∗ (? + ?)
For any binary string x, let #0(x) and #1(x) denote the number of 0’sand the number of 1’s in x, respectively. Design a DFA to accept the following language:L = {x | x ∈ {0, 1}∗, the summation 3 · #0(x) + 2 · #1(x) is divisible by 5}
Question 2: Ʃ = {a, b} Give the regular expression for all strings in which any b’s that occur are in groups of an odd number at a time. Some sample strings in the language aabaabbbab, bbbbbabbbaab, aaaa, ababab Some sample strings NOT in the language abba, babbbb
For the following pairs of expressions, find a unifier for each pair if a unifier exists. If a unifierdoes not exist, explain why.(a) p(X,Y) and p(a,Z)(b) p(X,X) and p(a,b)(c) f(X,Y) and f(a,g(a))(d) q(X) and ¬q(a)