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

Write in C++ a polymorphic and recursive function, print(x, n, w),which can print an object, x, the given number of times, n, separated by the user’s choice of white space character, w.Both n and w must be “default arguments”. The default value of “n” must be 1 and the default value of “w” must be the space character.(1) (2) (3)NB: If any part of your solution to a question has been extracted from a book, past tests or exams, then full disclosure must be given with complete references to the source. Non-disclosures will carry heavy penalties.
C++ Help
List ManipulationWrite the following functions on lists in Scheme. The semantics of the func-tions is described through examples.(1) (define rev (lambda (l) ...)) ...(rev ’(e b c d)) --> ’(d c b e)Note: This function reverses the components of a list. (2) (define maxx (lambda (l) ...))...(maxx ’(1 2 3)) --> 3Note: You are encouraged to use the reduce function
What language does the expression ((a * a) b) | b?
Q2. Design a recursive function with the prototype "totalConsonants (char* str, int size)" in C++ that calculates the total number of consonants in the provided string.
Define a LISP function MONTH->INTEGER which takes as argument a symbol that should be thename of a month, and which returns the number of the month. For example:(MONTH->INTEGER 'MARCH) => 3 (MONTH->INTEGER 'JUNE) => 6If the argument is not a symbol that is the name of a month, the function should return the symbolERROR. For example:(MONTH->INTEGER 'C) => ERROR (MONTH->INTEGER 7) => ERROR(MONTH->INTEGER 'QUOTE) =>ERROR (MONTH->INTEGER '(MAY)) =>ERROR
Question 3) a) Write regular expression for all binary strings having substring 010. b) Design a DFA that recognizes the language with strings in part (a).
The following problems best solved using stack structures, EXCEPT Select one: A.Balancing of parenthesis B.Evaluation of functions containing recursive calls C.Removal of items in random order D.Evaluation of postfix expressions
Prolog. R emember the "take" function of Haskell? It can be defined in Haskell as: take :: Int -> [a] -> [a] take 0 _ = [] take _ [] = [] take n (x:xs) = x : take (n-1) xs Formulate the appropriate Prolog predicate "take(N,Xs,Ys)" which is true if (and only if) "Ys" is what results from taking "N" elements from "Xs". That is, "take(3,[1,2,3,4,5],[1,2,3])." would evaluate to "true", or "take(3,[1,2,3,4,5],Ys)." would give "Ys = [1,2,3]", while "take(3,[1,2],Ys)" would give "Ys = [1,2]"
def optimize_tail_calls(original_scheme_eval): """Return a properly tail recursive version of an eval function.""" def optimized_eval(expr, env, tail=False): """Evaluate Scheme expression EXPR in Frame ENV. If TAIL, return an Unevaluated containing an expression for further evaluation. """ if tail and not scheme_symbolp(expr) and not self_evaluating(expr): return Unevaluated(expr, env) result = Unevaluated(expr, env) # fill in code code here while isinstance(result, Unevaluated): #code here return optimized_eval scheme_eval = optimize_tail_calls(scheme_eval)
Consider the following recursive definition to define a language L over the alphabet S={0,1}: Base Step: 1∈L Recursion Step: For each w in L, 0w0 is in L. Each string in L can be derived from the base step together with a finite number of applications of the recursion step. a) List two string in L. b) List two strings not in L. c) Write set notation to describe L.
In computer science, Backus-Naur form or Backus normal form (BNF) is a meta syntax notation for Context-Free Grammars, often used to describe the syntax of languages used in computing, such as computer programming languages, document formats, instruction sets, and communication protocols. In this context, develop the BNF grammar and parse tree for the following Program: #include int main() { int n,r,sum=0,temp; printf("enter the number="); scanf("%d",&n); temp=n; while(n>0) { r=n%10; sum=sum+(r*r*r); n=n/10%; } if(temp==sum) printf("armstrong number "); else printf("not armstrong number"); return 0; }