Find the accepted and rejected strings of given languages: a) The set of all strings containing no three consecutive O's. b) The set of all strings over {0,1} having even number of 0's & odd number of l's. c) {W1C W30"1°O'1*w2 W3 | w1, w2 belongs to (0, 1)* & w3 holds empty value, length(w.) != length(w), x = 3', y > z}.

Find the accepted and rejected strings of given languages: a) The set of all strings containing no three consecutive O's. b) The set of all strings over {0,1} having even number of 0's & odd number of l's. c) {W1C W30"1°O'1w2 W3 | w1, w2 belongs to (0, 1) & w3 holds empty value, length(w.) != length(w), x = 3', y > z}.

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

Consider the following languages over {0, 1}: L3 = {w : w begins and ends with different symbols, |w| £ 3} L4 = {w : w = wR, |w| £ 3} Enumerate the first 6 strings in the L-ordering of the following. If there are fewer than 6 string, enumerate the entire language: L3 L4 L33 L4*
Draw a DFA that accepts the following language over the alphabet {0,1}: the set of all strings such that any substring of four consecutive symbols does not have exactly two 0s.
Give DFA’s accepting the following languages over the alphabet {0, 1} Language : The set of strings that the number of 0’s is divisible by five, and the number of 1’s is divisible by 3
b) Write the CFG for the following language over alphabet Σ= {p,q ,r} L={ pqr, ppqrr, pppqrrr, ppppqrrrr, pppppqrrrrr, ……………..} Hint : pn q rn where n>=1 Note: derive at least four strings for the given CFG
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
Consider the following languages over Σ = {0,1} for L2 is the language of all strings that do not contain the pattern 00.
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
Question 2 c) Give a regular expression for the following regular languages, assuming the alphabet is Σ := {0, 1}. I. The set of all strings, when viewed as binary representation of integers, that are divisible by 2. II. The set of all strings containing 00. III. Give a closed-form regular expression for the set of all string not containing consecutive 00.
Suppose L is any Regular language defined over the alphabet Σ = {0, 1} where every string contains atmost one 0's and atleast two 1's. If M is the DFA that Accepts L, then least number of states required to be in minimal DFA will be?
Let Cbe the language over {a, b,c, d, e, f} accepting all strings so that: 1.There are precisely two b’s in the string. 2.Every a is immediately followed by an odd number of e’s. 3.Every d is immediately followed by an even number of f’s. 4.e’s and f’s don’t occur except as provided in rules 2 and 3. 5.All a’s occur after the first b. 6.All d’s occur before the second b. 7.In between the two b’s there are exactly twice as many a’s as d’s.HINT: Don’t be intimidated by the number of rules. The way they interact actually helps you simplify the number of cases you have to deal with while constructing this grammar. a. Construct a context-free grammar generating C.Explain how your construction accounts for each rule. b. We could eliminate one rule from Cand make it regular. Which rule would that be, and why would it work? You do not need a formal proof, but you do need an explanation.
Define following through descriptive definition (a)The language { ap bm cp de} of strings defined over Σ={a,b,c,d}, as m=odd number, p= prime numbers , e =even (b) The language L of strings that start with bba and end with abc, defined over Σ={a,b,c}, what will be the minimum length string
The quotient of two languages L_1/L_2 = { x | ∃y ∈ L_2 (xy ∈ L_1) } That is, the set of strings from which a string in L_1 could be created by appending a string in L_2. So, {aaa, aab, aba, abb} / {a, bb} = {aa, ab, a} Are regular languages closed with respect to quotient? What if L_1 is not regular but L_2 is? Is L_1/L_2 guaranteed to be regular? What if L_2 is not regular but L_1 is? Is L_1/L_2 guaranteed to be regular? Exhibit a nonregular language L1 and regular language L2 for which L1/L2 is nonregular.