Problem 3. (Regular Expressions-DFA) Show that the following languages are regular by giving aregular expression and DFA that describes each one:a) L1= {all strings over Σ= {0, 1} containing at least three 1's}.b) L2= {all strings over Σ =c) L3 = {all strings over Σ =d) L4= {all strings over Σ =e) L5= {all strings over Σ ={0, 1} that contain the substring 11 and the substring 00}.{0,1} that does not contain the substring 111}.{a,b,c} with length less than 2}.{a,b,c} in which the number of c's is divisible by 32}.

We are given a language L1 and we are asked to show that the language L1 is a regular language.…

Problem 3. (Regular Expressions-DFA) Show that the following languages are regular by giving a regular expression and DFA that describes each one: a) L1= {all strings over Σ= {0, 1} containing at least three 1's}. b) L2= {all strings over Σ= {0, 1} that contain the substring 11 and the substring 00}. c) L3= {all strings over Σ= {0, 1} that does not contain the substring 111}. d) L4= {all strings over Σ = {a,b,c} with length less than 2}. e) L5= {all strings over Σ= {a,b,c} in which the number of c's is divisible by 32).

Problem 3. (Regular Expressions-DFA) Show that the following languages are regular by giving a regular expression and DFA that describes each one: a) L1= {all strings over Σ= {0, 1} containing at least three 1's}. b) L2= {all strings over Σ= {0, 1} that contain the substring 11 and the substring 00}. c) L3= {all strings over Σ= {0, 1} that does not contain the substring 111}. d) L4= {all strings over Σ = {a,b,c} with length less than 2}. e) L5= {all strings over Σ= {a,b,c} in which the number of c's is divisible by 32).

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

For each of the following languages L, give a regular expression that represents L and draw or describe a DFA that recognizes L. You do not need to justify your answers. (a) All strings in {0,1}* that do not contain either 100 or 011 as a substring (b) All strings in {0, 1,2}* that do not contain either 01 or 12 or 20 as a substring
1. Fill out the table for executing the polynomial-time dynamic programming algo- rithm for deciding whether the string 1001 is in the context-free language generated by the following CFG. Fill the table completely do not stop the algorithm early. (Note: This CFG is not quite in Chomsky Normal Form since A appears on the right-hand side of a rule, but the same algorithm still works.) А — ВС | СС В — ВА| 0 С + АВ | ВВ | 1
Hallo by Peter Linz, "Introduction to Formal Languages and Automaton", 6th edition, 2017. The cut is from chapter 2, section 1. thank u s much :)))))
CFG Assignment(at least 2 strings must be derive to prove each CFG) Language: of all strings having many 0’s or no zero, defined over {0} Language: of all strings having exactly one 0’s or exactly one 1, defined over {0,1} Language: of all strings having many 0’s or many 1’s or no zero or no one, defined over {0,1} 0*10*
027. Design a CFG for the language of non- palindromes over (a, b}. Find the derivations for the strings abab and ababaa. e
3 Regular Expressions Give a regular expression for the following languages La and L,. Let E= {0, 1} a) La = {w: w ends with '01' or has odd length} b) L = {w: every '01' in w is followed by a 0.}
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.
Question 3: Write a regular expression for each of the following languages: (a) all strings over {a, b, c) that are of length at most three. (b) all strings over {a, b, c} that are of length exactly two. (c) All strings over {0, 1} that start with 1 and end with 0. (d) All strings over {0, 1} that end in 101
. Design DFA for the following over { a,b} (ii) All strings that has atleast two occurrences of b between any two occurrence of a.
Note: this is discrete structure question
remove left recursion from the following grammar: S S a S|U U UuU|T T t|f|T n| (S)
i) Draw an FA accepting the language of all strings containing no more than one occurrence of the string aa. (The string aaa contains two occurrences of aa.) over{a,b}