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

Write me a code in MATLAB It calculates the area of a circle taking into account that I give you the value of the radius and the code calculates the area Note that the law for area of a circle is (n^2 * pie).
Generate a constrained Regular Expression for the language that is described by the following: 1) all strings MUST begin with at least one 'a' character 2) all strings MUST end with EXACTLY one 'a' 3) between the 'a' characters are an unknown number of 'b', 'c', and 'd' characters. 4) the number of 'c' characters are at least one. 5) the number of 'b' characters is exactly the same as the number of 'd' characters.
a) Construct CFG which accepts the strings of any number of a's followed by any number of b's, and ending with a.
The following two languages over {0,1} L1: All strings that begin in '00' L2: All strings that have the substring '1' embedded.
Q. Construct DFA’s for FollowingWhen  = {0, 1}v. Machine that accepts the language which has either odd number of 0’s or even number of 1’s but not both together .vi. Machine that accepts the language which has both 01 and 10 as substring .vii. Machine that accepts the language which has neither 00 nor 11 as a substring.
Built regular expression of the following. 1. A language of any combination of even number of a's and even number of b’s containing abb as a substring. 2. Write an RE for the language L = {0^1m | where m + n is odd}. 3. All string does not contain the substring 'aaa' but has exactly one 'a'
3. Construct regular expressions for the following languages over the binary alphabet {a, b}: on set your sysugn a. Write the regular expression for the language starting with a but not having consecutive b's. b. Binary strings that contain an odd number of a's (in the simplest form possible).
Q2. Construct regular expressions for the following languages. Verify your answer by generating at least one correct string. a. The language over the alphabet (a, b, c) of all three letter words that end in bc b. The language over the alphabet (a, b, c}of all words starting with any number of a's, followed by any number of b's and ending in one or two c's c. The language over the alphabet (a, b, c, d, e, f} where each string starts with a "ab", has either c or d in the middle, and ends with any number of the substring "ef". d. The language over the alphabet (a, b, c) of all words where the words start with either an a or a b followed by as many c's as we want. (the total number or a or b cannot be more that 1) (in any string ther can only be one a or one b) e. The language of only those strings over A= {0, 1} which have exactly 2 zeros