The following questions are related to regular expression and regular language: (i) Let r,, r2, r be regular expressions. Find all the regular ones from the following expressions: a·p, r³, r* · 0, (r*)), r + r2 – r, (4) +r + 12, n+r, ÷ r,, r*), (r, r2), {rn + r2}, a+¢ (ii) Let E= {a, b}. Given regular expressions r = a*b*, r' = ba*ab* + (ab)* (ba)* and Ir" = (a* + b)b(a + b)*,- nd L(r), L(r"), and L(r"), the languages defined by r, r', r", respectively. (iii) Let E = {a, b}. Given the language L = {aam b"b, (ba)*, bb: n, m 2 0 and h 2 1}, find the regular expression r such that L(r) = L.

The following questions are related to regular expression and regular language: (i) Let r,, r2, r be regular expressions. Find all the regular ones from the following expressions: a·p, r³, r* · 0, (r)), r + r2 – r, (4) +r + 12, n+r, ÷ r,, r), (r, r2), {rn + r2}, a+¢ (ii) Let E= {a, b}. Given regular expressions r = ab, r' = baab + (ab)* (ba)* and Ir" = (a* + b)b(a + b),- nd L(r), L(r"), and L(r"), the languages defined by r, r', r", respectively. (iii) Let E = {a, b}. Given the language L = {aam b"b, (ba), bb: n, m 2 0 and h 2 1}, find the regular expression r such that L(r) = L.

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

In C programing Write a recursive function that returns the product of the digits of its integer input parameter, n. You may assume that n is non-negative. For example, productDigits(243) should return 24, since 2 x 4 x 3 = 24.int productDigits (int n) {
1. Reduce the following function: ((A O B)•(A•C) )•( (A•B) +(A © B) )
Write a recursive function that returns both the smallest and the largest element in an int array. Also, write a program to test your function.
Ackermann's function (A) is defined as:A(m,n):Ackermann's function (A) is defined as:A(m,n):n+1, if m=0A(m-1,1), if m>0 and n=0A(m-1,A(m,n-1)), if m>0 and n> 0Write a recursive Python function to implement Ackermann's function. How many recursive calls willbe required to evaluate A(2,3)?n+1, if m=0A(m-1,1), if m>0 and n=0A(m-1,A(m,n-1)), if m>0 and n> 0Write a recursive Python function to implement Ackermann's function. How many recursive calls willbe required to evaluate A(2,3)?
The 4th problem mimics the situation where eagles flying in the sky can be spotted and counted.FindEagles: a recursive function that examines and counts the number of objects (eagles) in aphotograph. The data is in a two-dimensional grid of cells, each of which may be empty (value 0) orfilled (value 1 to 9). Maximum grid size is 50 x 50. The filled cells that are connected form an object(eagle). Two cells are connected if they are vertically, horizontally, or diagonally adjacent. Thefollowing figure shows 3 x 4 grids with 3 eagles. 0 0 1 21 0 0 01 0 3 1 FindEagle function takes as parameters the 2-D array and the x-y coordinates of a cell that is a part ofan eagle (non-zero value) and erases (change to 0) the image of an eagle. The function FindEagleshould return an integer value that counts how many cells has been counted as part of an eagle and havebeen erased. The following sample data has two pictures, the first one is 3 x 4, and the second one is 5 x 5 grids. Notethat your program…
1. Below, enter code to complete implementation of a recursive function sum allintegers(), which takes an input n and adds all integers preceding it, up to n: add all integers(n):
Write the simplest C++ program that will demonstrate iteration vs recursion using the following guidelines - Please include pre/post and pseudocode for the 3 functions which are not 'main' in the solution. Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper…
SML programming Write a recursive function np(n) which takes a non negative n and generates a list of numbers from n+1 down to 0. You may assume that input of n is always valid. Must use identical function name and parameter(s). np(4)⟶[5,4,3,2,1,0]
In this small funtion, identify and define each part of the functionint addition (int a, int b) { int r; r=a+b; return r; }
2. Write a recursive function printNum()that prints any given number by putting spaces between successive characters to be printed. For example: printNum (12) prints 1 2 printNum (327) prints 3 2 7 printNum (-912) prints - 912 Programming Language :- C
Describe the following sets by regular expressions, (с) {01, 10} (d) {а, ab}.
2. Consider the following function: def func1(n): output = 1 for i in range (1, n) : output = i return output Rewrite the function as a recursive function.