1. Write regular expression for the following languages, alphabet {0,1}a. The set of strings that do not end with 11b. The set of strings that do not contain substring 01c. The set of strings having 0 at every 3rd position.d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set ofall strings that are at least of length 4 and contains an even number of 1's.2. Draw the DFA for the following languagesa. L = {w]w contains substring "aba" and has b in the second last position} b. L ={w[ every 3rd symbol in w is 0} e.g. 110100, 000110001. But 101 won't beaccepted since the 3rd symbol is 1.c. Set of all strings that are at least of length 4 and contain an even number of 1'sd. L = {w| The 3rd last symbol in w is 0}

The following are the regular expressions:- a. The set of strings that do not end with 11. Answer:…

1. Write regular expression for the following languages, alphabet {0,1} a. The set of strings that do not end with 11 b. The set of strings that do not contain substring 01 c. The set of strings having 0 at every 3rd position. d. Describe the language given by the regular expression 0*10*10*1(1|0)* e. Set of all strings that are at least of length 4 and contains an even number of l's. 2. Draw the DFA for the following languages

1. Write regular expression for the following languages, alphabet {0,1} a. The set of strings that do not end with 11 b. The set of strings that do not contain substring 01 c. The set of strings having 0 at every 3rd position. d. Describe the language given by the regular expression 010101(1|0) e. Set of all strings that are at least of length 4 and contains an even number of l's. 2. Draw the DFA for the following languages

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

2- Write a regular expression for each of the following languages over {a,b}: • String of a's and b's that begin with a and end with b. • Strings that have at least two a's. • Strings that have an even number of a's. • Strings that do not have two a's in a row. • Strings that do not end with the substring ab.
Write regular expressions of the following languages- The set of strings that start and end with the same symbols 01. Σ = {0,1,2} The set of strings that contain both substrings ‘101’ and ‘000’. Σ = {0,1} The set of strings having 0 at every 3rd position from the beginning. Σ = {0,1}. For example- 000, 010, 0100100, 110110, etc. The set of strings that do not contain substring ‘10’. Σ = {0,1} The set of strings that do not end with ‘01’. Σ = {0,1} Following is an example of different ways one can declare variables in some programming language.Write down the regular expression that can generate such variable declarations.Assume that- All variable names are at most five (previously written as exactly five; both will be considered correct) characters long. Variable names can contain only small letters [a-z], digits [0-9], and two special characters $ (dollar) and _ (underscore). $ sign can only be used at the beginning. No names can start with digits. The variable types…
I NEED ONLY CORRECT OPTION NO NEED TO EXPLAIN IN DEPTH,PLEASE SOLVE ALL THE QUESTION, DON'T LEAVE ANY QUESTION AND IF YOU DON'T KNOW THE CORRECT ANSWER THEN PLEASE LEAVE IT OTHERWISE I WILL DOWNVOTE IT.... 1. Consider the language I-(All strings of odd length) over the input alphabet {a, b).Which of the following is the correct regular expression for the language I?a) ((a+b)a(a+b))*+((a+b)b(a+b))*b) a(a+b)* (a+b)*+b(a+b) *(a+b)*c) a(a+b)(a+b))*+b((a+b)(a+b))*d) None of the above 2. What is the output of the following code?import java.util.*;class Main{public static void main(String args []){ArrayList mylist = new ArrayList ();mylist.add("C");mylist. add("H");ArrayList mylist2 = new Arraylist ();mylist2.add("C");mylist2.add(1, "H");System.out.printin(mylist.equals (mylist2));}a. 0B. falsec. trued. 1 3. Which statement is true about fourth normal form?Answer Choices:a. Every determinant must be a candidate key.b. There should not be any transitive dependency.c. There should not be any…
regular expressions Exercise: Describe the languages denoted by the following regular expressions: ◦a) a(a|b)*a..a) a*ba*ba*ba*.b) (aa|bb)*((ab|ba)(aa|bb)*(ab|ba)(aa|bb)*)*. and gave me example for a and b contain 20 String
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
Write regular expressions for the following languages on {0, 1}. A. all strings ending in 10, B. all strings not ending in 10,
3) Give a regular expression defining each of the following languages over the alphabet Σ ={a, b}.(a) L = {aab, ba, bb, baab};(b) The language of all strings containing exactly two b's.(c) The language of all strings containing at least one a and at least one b.(d) The language of all strings that do not end with ba.(e) The language of all strings that do not containing the substring bb.(f) The language of all strings in which every b is followed immediately by aa.
Can you help me with this probem and the parts that come along with it because i am confused I only need help with part A and part B. Can you please label the problem and can you do it step by step showing work and can you explain it as well. Question that I need help with:1.49 a. Let B = {1 k y| y ∈ {0, 1} ∗ and y contains at least k 1s, for k ≥ 1}. Show that B is a regular language. b. Let C = {1 k y| y ∈ {0, 1} ∗ and y contains at most k 1s, for k ≥ 1}. Show that C isn’t a regular language.
Write regular expressions representing the following languages over the alphabet {0,1}. a.) Language of all strings that end with 010 b.) Language of all strings that do not have 2 consecutive 1s.
Given the language L = { a, b, bd, da }a) List the first 12 elements of L* in shortlex order.b) List the first 10 strings of L* that are of length of 6 and begin with ‘da’. Strings should bein shortlex order within the length of 6.
1. For each of the following regular expressions find a language (i.e., a set of strings) over A = {a,b,c} that can be represented/described by that expression. a. ??∗ + ?∗?? 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